Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Contraction hierarchies: faster and simpler hierarchical routing in road networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Highway dimension, shortest paths, and provably efficient algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Alternative route graphs in road networks
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
A hub-based labeling algorithm for shortest paths in road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
VC-dimension and shortest path algorithms
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Engineering multilevel graph partitioning algorithms
ESA'11 Proceedings of the 19th European conference on Algorithms
PHAST: Hardware-Accelerated Shortest Path Trees
IPDPS '11 Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium
Graph Partitioning with Natural Cuts
IPDPS '11 Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium
Acceleration of shortest path and constrained shortest path computation
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Efficient route compression for hybrid route planning
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Flexible route guidance through turn instruction graphs
Proceedings of the 1st ACM SIGSPATIAL International Workshop on MapInteraction
| Hi-index | 0.00 |
We present a fast algorithm with preprocessing for computing multiple good alternative routes in road networks. Our approach is based on single via node routing on top of Contraction Hierarchies and achieves superior quality and efficiency compared to previous methods. The algorithm has neglectable memory overhead.