18 search results - page 2 / 4 » Point-to-Point Shortest Path Algorithms with Preprocessing |
PVLDB
2010
13 years 3 months ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
ESA
2005
Springer
13 years 11 months ago
2005
Springer
We present a new speedup technique for route planning that exploits the hierarchy inherent in real world road networks. Our algorithm preprocesses the eight digit number of nodes n...
SIAMCOMP
2010
13 years 7 days ago
2010
We describe algorithms to compute the shortest path homotopic to a given path, or the shortest cycle freely homotopic to a given cycle, on an orientable combinatorial surface. Unli...
ACSC
2007
IEEE
13 years 12 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...