Shortest paths in Euclidean graphs
Algorithmica
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Algorithm 360: shortest-path forest with topological ordering [H]
Communications of the ACM
Dijkstra's algorithm on-line: an empirical case study from public railroad transport
Journal of Experimental Algorithmics (JEA)
Using Multi-level Graphs for Timetable Information in Railway Systems
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
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
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Combining speed-up techniques for shortest-path computations
Journal of Experimental Algorithmics (JEA)
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Engineering highway hierarchies
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Shortest Path Algorithms: Engineering Aspects
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Bidirectional heuristic search reconsidered
Journal of Artificial Intelligence Research
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
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
The Shortcut Problem --- Complexity and Approximation
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
GPU-based computation of distance functions on road networks with applications
Proceedings of the 2009 ACM symposium on Applied Computing
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
Journal of Discrete Algorithms
Landmark-based routing in dynamic graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
LunarVis - analytic visualizations of large graphs
GD'07 Proceedings of the 15th international conference on Graph drawing
Bidirectional A* search for time-dependent fast paths
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Timetable information: models and algorithms
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Relational approach for shortest path discovery over large graphs
Proceedings of the VLDB Endowment
An a* algorithm framework for the point-to-point time-dependent shortest path problem
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Graph analysis: do we have to reinvent the wheel?
First International Workshop on Graph Data Management Experiences and Systems
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
During the last years, several speed-up techniques for Dijkstra's algorithm have been published that maintain the correctness of the algorithm but reduce its running time for typical instances. They are usually based on a preprocessing that annotates the graph with additional information which can be used to prune or guide the search. Timetable information in public transport is a traditional application domain for such techniques. In this paper, we provide a condensed overview of new developments and extensions of classic results. Furthermore, we discuss how combinations of speed-up techniques can be realized to take advantage from different strategies.