Goal-directed shortest-path queries using precomputed cluster distances

Authors:
Jens Maue;Peter Sanders;Domagoj Matijevic
Affiliations:
Institute of Theoretical Computer Science, ETH Zürich, Switzerland;Fakultät für Informatik, Universität Karlsruhe (TH), Germany;Department of Mathematics, J.J. Strossmayer University, Osijek, Croatia
Venue:
Journal of Experimental Algorithmics (JEA)
Year:
2010

Citing 15
Cited 3

Faster shortest-path algorithms for planar graphs

Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Multilevel k-way partitioning scheme for irregular graphs

Journal of Parallel and Distributed Computing
Undirected single-source shortest paths with positive integer weights in linear time

Journal of the ACM (JACM)
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
Sorting and Searching on the Word RAM

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
A Simple Shortest Path Algorithm with Linear Average Time

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Integer priority queues with decrease key in constant time and the single source shortest paths problem

Journal of Computer and System Sciences - Special issue: STOC 2003
Computing the shortest path: A search meets graph theory

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Bidirectional heuristic search reconsidered

Journal of Artificial Intelligence Research
Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Contraction hierarchies: faster and simpler hierarchical routing in road networks

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Goal directed shortest path queries using precomputed cluster distances

WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Highway hierarchies hasten exact shortest path queries

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Acceleration of shortest path and constrained shortest path computation

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

Customizable route planning

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Scope-based route planning

ESA'11 Proceedings of the 19th European conference on Algorithms
Shortest-path queries in static networks

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We demonstrate how Dijkstra's algorithm for shortest path queries can be accelerated by using precomputed shortest path distances. Our approach allows a completely flexible tradeoff between query time and space consumption for precomputed distances. In particular, sublinear space is sufficient to give the search a strong “sense of direction”. We evaluate our approach experimentally using large, real-world road networks.