LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Using Multi-level Graphs for Timetable Information in Railway Systems
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Partitioning graphs to speed up dijkstra's algorithm
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Goal-directed shortest-path queries using precomputed cluster distances
Journal of Experimental Algorithmics (JEA)
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Engineering fast route planning algorithms
WEA'07 Proceedings of the 6th 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
Path queries on massive graphs based on multi-granular graph partitioning
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Efficient data management in support of shortest-path computation
Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science
Engineering highway hierarchies
Journal of Experimental Algorithmics (JEA)
Exact Routing in Large Road Networks Using Contraction Hierarchies
Transportation Science
Exact graph search algorithms for generalized traveling salesman path problems
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
| Hi-index | 0.00 |
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.