Please use this identifier to cite or link to this item:
Title: Optimal location queries on road networks
Authors: Lip, Pin Han
Keywords: DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
Issue Date: 2015
Abstract: Shortest path search are a popular topic due to the increasingly use of navigation products and social networks. A research paper, “Robust Exact Distance Queries on Massive Networks”, aims to provide a new solution for how to achieve shortest path search query quickly. This report looks at how pre-processing algorithms can help to accelerate the query process and how SamPG algorithm is able to query in large networks and yet minimising the resources required to do so. In addition, we will compare it with similar algorithms previously developed and to determine their performance in pre-processing datasets.
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
FYP Amended Report_LIPPINHAN_U1221293B.pdf
  Restricted Access
868.56 kBAdobe PDFView/Open

Page view(s)

Updated on Nov 25, 2020


Updated on Nov 25, 2020

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.