A practical shortest path algorithm with linear expected time

SIAM Journal on Computing

Volumn 37, Issue 5, 2007, Pages 1637-1655

  Goldberg, Andrew V ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Algorithms; Data structures; Experimental evaluation; Shortest paths

Indexed keywords

ARC LENGTHS; EXPERIMENTAL DATUMS; EXPERIMENTAL EVALUATION; LINEAR AVERAGES; NEW ALGORITHMS; ORIGINAL ALGORITHMS; SHORTEST PATH ALGORITHMS; SHORTEST PATHS;

CAVITY RESONATORS; DATA STRUCTURES; FILE ORGANIZATION; PROBABILITY DISTRIBUTIONS; WIRELESS SENSOR NETWORKS;

ALGORITHMS;

EID: 49749144986     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070698774     Document Type: Article

References (46)

1. A. V. AHO, J. E. HOPCROFT, AND J. D. ULLMAN, The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
2. R. K. AHUJA, K. MEHLHORN, J. B. ORLIN, AND R. E. TARJAN, Faster algorithms for the shortest path problem, J. ACM, 37 (1990), pp. 213-223.
3. A. BRODNIK, S. CARLSSON, J. KARLSSON, AND J. I. MUNRO, Worst case constant time priority queues, in Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SLAM, Philadelphia, 2001, pp. 523-528.
4. B. V. CHERKASSKY AND A. V. GOLDBERG, Negative-cycle detection algorithms, Math. Program., 85 (1999), pp. 277-311.
5. B. V. CHERKASSKY, A. V. GOLDEBERG, AND T. RADZIK, Shortest paths algorithms: Theory and experimental evaluation, Math. Programming, 73 (1996), pp. 129-174.
6. B. V. CHERKASSKY, A. V. GOLDBERG, AND C. SILVERSTEIN, Buckets, heaps, lists, and monotone priority queues, SIAM J. Comput., 28 (1999), pp. 1326-1346.
7. H. CHERNOFF, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Statistics, 23 (1952), pp. 493-507.
8. R. COLE AND U. VISHKIN, Deterministic coin tossing with applications to optimal parallel list ranking, Inform, and Control, 70 (1986), pp. 32-53.
9. E. V. DENARDO AND B. L. FOX, Shortest-route methods: 1. Reaching, pruning, and buckets, Oper. Res., 27 (1979), pp. 161-186.
10. R. B. DIAL, Algorithm 360: Shortest path forest with topological ordering, Comm. ACM, 12 (1969), pp. 632-633.
11. R. B. DIAL, F. GLOVER, D. KARNEY, AND D. KLINGMAN, A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees, Networks, 9 (1979), pp. 215-248.
12. E. W. DIJKSTRA, A note on two problems in connection with graphs, Numer. Math., 1 (1959), pp. 269-271.
13. E. A. DINIC, Economical algorithms for finding shortest paths in a network, in Transportation Modeling Systems, Yu. S. Popkov and B. L. Shmulyian, eds., Institute for System Studies, Moscow, 1978, pp. 36-44 (in Russian).
14. L. R. FORD. JR., Network Flow Theory, Technical report P-932, Rand Corporation, Santa Monica, CA, 1956.
15. L. R. FORD, JR., AND D. R. FULKERSON, Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
16. M. L. FREDMAN AND R. E. TARJAN, Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM, 34 (1987), pp. 596-615.
17. M. L. FREDMAN AND D. E. WILLARD, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, J. Comput. System Sci., 48 (1994), pp. 533-551.
18. H. N. GABOW, Scaling algorithms for network problems, J. Comput. System Sci., 31 (1985), pp. 148-168.
19. G. GALLO AND S. PALLOTTINO, Shortest paths algorithms, Ann. Oper. Res., 13 (1988), pp. 3-79.
20. F. GLOVER, R. GLOVER, AND D. KLINGMAN, Computational study of an improved shortest path algorithm, Networks, 14 (1984), pp. 25-37.
21. A. V. GOLDBERG, A Simple Shortest Path Algorithm with Linear Average Time, Technical report STAR-TR-01-03, STAR Lab., InterTrust Tech., Inc., Santa Clara, CA, 2001.
22. A. V. GOLDBERG, A simple shortest path algorithm with linear average time, in Proceedings of the 9th ESA, Lecture Notes in Comput. Sci. 2161, Springer-Verlag, Berlin, 2001, pp. 230-241.
23. A. V, GOLDBERG, Shortest path algorithms: Engineering aspects, in Proceedings of the ISAAC '01, Lecture Notes in Comput. Sci., Springer-Verlag, Berlin, 2001, pp. 502-513.
24. A. V. GOLDBERG AND C. SILVERSTEIN, Implementations of Dijkstra's algorithm based on 'multilevel buckets, in Lecture Notes in Econom. and Math. Systems 450 (Refereed Proceedings), P. M. Pardalos, D. W. Hearn, and W. W. Hages, eds., Springer-Verlag, Berlin, 1997, pp. 292-327.
25. T. HAGERUP, Improved shortest paths in the word RAM, in 27th International Colloq. on Automata, Languages and Programming, Geneva, Switzerland, 2000, pp. 61-72.
26. T. HAGERUP, Simpler commutation of single-source shortest paths in linear average time, in Proceedings of STACS 2004, ACM, New York, 2004, pp. 362-369.
27. M. S. HUNG AND J. J. DIVOKY, A computational study of efficient shortest path algorithms, Comput. Oper. Res., 15 (1988), pp. 567-576.
28. H. IMAI AND M. IRI, Practical efficiencies of existing shortest-path algorithms and a new bucket algorithm, J. Oper. Res. Soc. Japan, 27 (1984), pp. 43-58.
29. D. B. JOHNSON, Efficient algorithms for shortest paths in sparse networks, J. ACM, 24 (1977), pp. 1-13.
30. U. MEYER, Single-source shortest paths on arbitrary directed graphs in linear average time, in Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2001, pp, 797-806.
31. J.-F. MONDOU, T. G. CRAINIC, AND S. NGUYEN, Shortest path algorithms: A computational study with the C progremming language, Comput. Oper. Res., 18 (1991), pp. 767-786.
32. B. M. E. MORET AND H. D. SHAPIRO, An empirical analysis of algorithms for constructing a minimum spanning tree, in Proceedings of the 2nd Workshop on Algorithms and Data Structures, Springer-Verlag, Berlin, 1991, pp. 99-117.
33. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, Cambridge, UK, 1995.
34. K. NOSHITA, A theorem on the expected complexity of Dijkstra's shortest path algorithm, J. Algorithms, 6 (1985), pp. 400-408.
35. S. PALLOTTINO, Shortest-path methods: Complexity, interrelations and new propositions. Networks, 14 (1984), pp. 257-267.
36. U. PAPE, Implementation and efficiency of Moore-algorithms for the shortest route problem, Math. Programming, 7 (1974), pp. 212-222.
37. R. RAMAN, Fast Algorithms for Shortest Paths and Sorting, Technical report TR 96-06, King's Colledge, London, 1996.
38. R. RAMAN, Priority queues: Small, monotone and trans-dichotomous, in Proceedings of the 4th Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 1136, Springer-Verlag, Berlin, 1996, pp. 121-137.
39. R. RAMAN, Recent results on single-source shortest paths problem, SIGACT News, 28 (1997), pp. 81-87.
40. J. T. STASKO AND J. S. VITTER, Pairing heaps: Experiments and analysis, Comm. ACM, 30 (1987), pp. 234-249.
41. R. E. TARJAN, Data Structures and Network Algorithms, CBMS-NSF Regional Conf. Ser. in Appl. Math. 44, SIAM, Philadelphia, 1983.
42. M. THORUP, Undirected single-source shortest paths with positive integer weights in linear time, J. ACM, 46 (1999), pp, 362-394.
43. M. THORUP, On RAM priority queues, SIAM J. Comput., 30 (2000), pp. 86-109.
44. R. A. WAGNER, A shortest path algorithm for edge-sparse graphs, J. ACM, 23 (1976), pp. 50-57.
45. J. W. J, WILLIAMS, Algorithm 232 (Heapsort), Comm. ACM, 7 (1964), pp. 347-348.
46. F. B. ZHAN AND C. E. NOON, Shortest path algorithms: An evaluation using real road networks, Transp. Sci., 32 (1998), pp. 65-73.