Single-source shortest-paths on arbitrary directed graphs in linear average-case time
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Compact Oracles for Reachability and Approximate Distances in Planar Digraphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Multiple-source shortest paths in planar graphs
SODA '05 Proceedings of the sixteenth 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
Planar graphs, negative weight edges, shortest paths, and near linear time
Journal of Computer and System Sciences - Special issue on FOCS 2001
Engineering highway hierarchies
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Engineering multilevel overlay graphs for shortest-path queries
Journal of Experimental Algorithmics (JEA)
Landmark-based routing in dynamic graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
WEA'07 Proceedings of the 6th 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
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
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
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
Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Fast paths in large-scale dynamic road networks
Computational Optimization and Applications
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
Bidirectional A* search for time-dependent fast paths
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Automatic generation of destination maps
ACM SIGGRAPH Asia 2010 papers
A case for time-dependent shortest path computation in spatial networks
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
i-KNOW '11 Proceedings of the 11th International Conference on Knowledge Management and Knowledge Technologies
Online computation of fastest path in time-dependent spatial networks
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
K*: A heuristic search algorithm for finding the k shortest paths
Artificial Intelligence
Efficient data management in support of shortest-path computation
Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science
Communications of the ACM
Spatial big-data challenges intersecting mobility and cloud computing
MobiDE '12 Proceedings of the Eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
Efficient dynamic routing on large road networks
SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
Finding nearest neighbors in road networks: a tree decomposition method
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Encoding network-constrained travel trajectories using routing algorithms
International Journal of Knowledge and Web Intelligence
Tour suggestion for outdoor activities
W2GIS'13 Proceedings of the 12th international conference on Web and Wireless Geographical Information Systems
| Hi-index | 0.02 |
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to one million times faster than Dijkstra's algorithm. We outline ideas, algorithms, implementations, and experimental methods behind this development. We also explain why the story is not over yet because dynamically changing networks, flexible objective functions, and new applications pose a lot of interesting challenges.