A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Shortest path and distance queries on road networks
2012
Proceedings of the VLDB Endowment
Computing the shortest path between two given locations in a road network is an important problem that finds applications in various map services and commercial navigation products. The stateof-the-art solutions for the problem can be divided into two categories: spatial-coherence-based methods and vertex-importancebased approaches. The two categories of techniques, however, have not been compared systematically under the same experimental framework, as they were developed from two independent
doi:10.14778/2140436.2140438
fatcat:jjmy2d2ipvfnbp476zwtf7bqc4