Abstract

We review shortest path algorithms based on the multi-level bucket data structure [6] and discuss the interplay between theory and engineering choices that leads to e#cient implementations. Our experimental results suggest that the caliber heuristic [17] and adaptive parameter selection give an e#cient algorithm, both on typical and on hard inputs, for a wide range of arc lengths.

Citations

1011	A note on two problems in connexion with graphs. Numerische Mathematik 1: 269–271 - Dijkstra - 1959
622	Flows in Networks - Ford, Fulkerson - 1962
493	Fibonacci heaps and their uses in improved network optimization algorithms - Fredman, Tarjan - 1987
141	Trans-dichotomous algorithms for minimum spanning trees and shortest paths - Fredman, Willard - 1990
124	Shortest Paths Algorithms: Theory and Experimental - Cherkassky, Goldberg, et al. - 1996
119	Efficient Algorithms for Shortest Paths in Sparse Networks - Johnson - 1977
91	Faster algorithms for the shortest path problem - Ahuja, Mehlhorn, et al.
69	Algorithm 360: Shortest-Path Forest with Topological Ordering - Dial
51	Shortest paths algorithms - Gallo, Pallottino - 1988
39	Priority queues: small, monotone and trans-dichotomous - Raman - 1996
36	Negative-cycle detection algorithms - Cherkassky, Goldberg - 1996
35	A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees. Networks - Dial, Glover, et al. - 1979
29	A simple shortest path algorithm with linear average time - Goldberg - 2001
25	Network Flow Theory - Ford - 1956
24	Single-source shortest-paths on arbitrary directed graphs in linear average-case time - Meyer - 2001
22	Improved shortest paths on the word RAM - Hagerup
20	An empirical analysis of algorithms for constructing a minimum spanning tree - Moret, Shapiro - 1994
17	Design and implementation of an ecient priority queue. Mathematical Systems Theory - Boaz, Kaas, et al. - 1977
16	monotone priority queues - Buckets, lists
16	Computational study of an improved shortest path algorithm - Glover, Glover, et al. - 1984
14	Implementations of Dijkstra's Algorithm Based on Multi-Level Buckets - Goldberg, Silverstein - 1997
13	Shortest-Route Methods: 1 - Denardo, Fox - 1979
10	A theorem on the expected complexity of Dijkstra's shortest path algorithm - Noshita - 1985
9	Economical algorithm for finding shortest paths in a network, In - Dinic - 1978
5	Fast Algorithms for Shortest Paths and Sorting - Raman - 1996