Experimental Evaluation of a New Shortest Path Algorithm
We evaluate the practical efficiency of a new shortest path algorithm for undirected graphs which was developed by the first two authors. This algorithm works on the fundamental comparison-addition model.
Theoretically, this new algorithm out-performs Dijkstra’s algorithm on sparse graphs for the all-pairs shortest path problem, and more generally, for the problem of computing single-source shortest paths from ω(1) different sources. Our extensive experimental analysis demonstrates that this is also the case in practice. We present results which show the new algorithm to run faster than Dijkstra’s on a variety of sparse graphs when the number of vertices ranges from a few thousand to a few million, and when computing single-source shortest paths from as few as three different sources.
KeywordsShort Path Minimum Span Tree Short Path Problem Graph Class Short Path Algorithm
Unable to display preview. Download preview PDF.
- [AHU74]A. V. Aho, J. E. Hopcroft, J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.Google Scholar
- [CLR90]T. Cormen, C. Leiserson, R. Rivest. Intro. to Algorithms. MIT Press, 1990.Google Scholar
- [G85]H. N. Gabow. A scaling algorithm for weighted matching on general graphs. In Proc. FOCS 1985, 90–99.Google Scholar
- [G01]A. Goldberg. A simple shortest path algorithm with linear average time. InterTrust Technical Report STAR-TR-01-03, March 2001.Google Scholar
- [G01b]A. Goldberg. Shortest path algorithms: engineering aspects. ISSAC 2001.Google Scholar
- [GS97]A. Goldberg, C. Silverstein. Implementations of Dijkstra’s algorithm based on multi-level buckets. Network optimization (1997), Lec. Not. Econ. Math. Syst. 450, 292–327.Google Scholar
- [Hag00]T. Hagerup. Improved shortest paths on the word RAM. In Proc. ICALP 2000, LNCS volume 1853, 61–72.Google Scholar
- [Jak91]H. Jakobsson, Mixed-approach algorithms for transitive closure. In Proc. ACM PODS, 1991, pp. 199–205.Google Scholar
- [Jar30]V. Jarník, O jistém problému minimálním. Práca Moravské Prírodovedecké Spolecnosti 6 (1930), 57–63, in Czech.Google Scholar
- [McG91]C. C. McGeoch. A new all-pairs shortest-path algorithm. Tech. Report 91-30 DIMACS, 1991. Also appears in Algorithmica, 13(5): 426–461, 1995.Google Scholar
- [MN99]K. Mehlhorn, S. Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge Univ. Press, 1999.Google Scholar
- [Mey01]U. Meyer. Single source shortest paths on arbitrary directed graphs in linear average-case time. In Proc. SODA 2001, 797–806.Google Scholar
- [MS94]B. M. E. Moret, H. D. Shapiro. An empirical assessment of algorithms for constructing a minimum spanning tree. In DIMACS Series on Discrete Math. and Theor. CS, 1994.Google Scholar
- [PR00]S. Pettie, V. Ramachandran. An optimal minimum spanning tree algorithm. In Proc. ICALP 2000, LNCS volume 1853, 49–60. JACM, to appear.Google Scholar
- [PR02]S. Pettie, V. Ramachandran. Computing shortest paths with comparisons and additions. In Proc. SODA’ 02, January 2002, to appear.Google Scholar
- [S00]P. Sanders. Fast priority queues for cached memory. J. Experimental Algorithms 5, article 7, 2000.Google Scholar
- [Tho01]M. Thorup. Quick k-median, k-center, and facility location for sparse graphs. In Proc. ICALP 2001, LNCS Vol. 2076, 249–260.Google Scholar
- [Z01]U. Zwick. Exact and approximate distances in graphs — a survey. In Proc. 9th ESA (2001), 33–48. Updated copy at http://www.cs.tau.ac.il/~zwick