Data structures and network algorithms
Data structures and network algorithms
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
Recent results on the single-source shortest paths problem
ACM SIGACT News
Buckets, Heaps, Lists, and Monotone Priority Queues
SIAM Journal on Computing
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Algorithm 360: shortest-path forest with topological ordering [H]
Communications of the ACM
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
SIAM Journal on Computing
Improved Shortest Paths on the Word RAM
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Priority Queues: Small, Monotone and Trans-dichotomous
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Transportation Science
| Hi-index | 0.00 |
We review shortest path algorithms based on the multi-level bucket data structure [6] and discuss the interplayb etween theorya nd engineering choices that leads to efficient implementations. Our experimental results suggest that the caliber heuristic [17] and adaptive parameter selection give an efficient algorithm, both on typical and on hard inputs, for a wide range of arc lengths.