A Shortest path algorithm for real-weighted undirected graphs

SIAM Journal on Computing

Volumn 34, Issue 6, 2005, Pages 1398-1431

  Pettiet, Seth ^a   Ramachandran, Vijaya ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b University of Texas at Austin   (United States)

Author keywords

All pairs shortest paths; Dijkstra's algorithm; Single source shortest paths; Undirected graphs

Indexed keywords

ALL-PAIRS SHORTEST PATHS; DIJKSTRA'S ALGORITHM; SINGLE-SOURCE SHORTEST PATHS; UNDIRECTED GRAPHS;

COMPUTABILITY AND DECIDABILITY; FUNCTIONS; GRAPH THEORY; INVERSE PROBLEMS; MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES;

ALGORITHMS;

EID: 29344454699     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702419650     Document Type: Article

References (68)

1. [AGM97] N. ALON, Z. GALIL, AND O. MARGALIT, On the exponent of the all pairs shortest path problem, J. Comput. System Sci., 54 (1997), pp. 255-262.
2. [AHU76] A. V. AHO, J. E. HOPCROFT, AND J. D. ULLMAN, On finding lowest common ancestors in trees, SIAM J. Comput., 5 (1976), pp. 115-132.
3. [AMO93] R. K. AHUJA, T. L. MAGNATI, AND J. B. ORLIN, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
4. [AMOT90] 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.
5. [BKRW98] A. L. BUCHSBAUM, H. KAPLAN, A. ROGERS, AND J. R. WESTBROOK, Linear-time pointer-machine algorithms for LCAs, MST verification, and dominators, in Proceedings of the 30th ACM Symposium on Theory of Computing (STOC), Dallas, TX, 1998, ACM, New York, 1998, pp. 279-288.
6. [BTZ98] G. S. BRODAL, J. L. TRÄFF, AND C. D. ZAROLIAGIS, A parallel priority queue with constant time operations, J. Parallel and Distrib. Comput., 49 (1998), pp. 4-21.
7. [Chaz00] B. CHAZELLE, A minimum spanning tree algorithm with inverse-Ackermann type complexity, J. ACM, 47 (2000), pp. 1028-1047.
8. [CLRS01] T. H. CORMEN, C. E. LEISERSON, R. L. RIVEST, AND C. STEIN, Introduction to Algorithms, MIT Press, Cambridge, MA, 2001.
9. [CMMS98] A. CRAUSER, K. MEHLHORN, U. MEYER, AND P. SANDERS, A parallelization of Dijkstra's shortest path algorithm, in Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Comput. Sci. 1450, Springer, New York, 1998, pp. 722-731.
10. [Dij59] E. W. DIJKSTRA, A note on two problems in connexion with graphs, Numer. Math., 1 (1959), pp. 269-271.
11. [Din78] E. A. DINIC, Economical algorithms for finding shortest paths in a network, Transportation Modeling Systems, (1978), pp. 36-44 (in Russian).
12. [Din03] Y. DINITZ, Personal communication, Ben-Gurion University, Be'er Sheva, Israel, 2003.
13. [FG85] A. M. FRIEZE AND G. R. GRIMMETT, The shortest-path problem for graphs with random arc-lengths, Discrete Appl. Math., 10 (1985), pp. 57-77.
14. [FR01] J. FAKCHAROENPHOL AND S. RAO, Planar graphs, negative weight edges, shortest paths, and near linear time, in Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), Las Vegas, NV, 2001, IEEE Press, Piscataway, NJ, pp. 232-241.
15. [F91] G. N. FREDERICKSON, Planar graph decomposition and all pairs shortest paths, J. ACM, 38 (1991), pp. 162-204.
16. [F76] M. L. FREDMAN, New bounds on the complexity of the shortest path problem, SIAM J. Comput., 5 (1976), pp. 83-89.
17. [FT87] M. L. FREDMAN AND R. E. TARJAN, Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM, 34 (1987), pp. 596-615.
18. [FW93] M. L. FREDMAN AND D. E. WILLARD, Surpassing the information-theoretic bound with fusion trees, J. Comput. System Sci., 47 (1993), pp. 424-436.
19. [G01] A. V. GOLDBERG, A simple shortest path algorithm with linear average time, in Proceedings of the 9th European Symposium on Algorithms (ESA), Lecture Notes in Comput. Sci. 2161, Springer, New York, 2001, pp. 230-241.
20. [G85a] H. N. GABOW, A scaling algorithm for weighted matching on general graphs, in Proceedings of the 26th IEEE Symposium on Foundations of Computer Science (FOCS), Portland, OR, 1985, IEEE Press, Piscataway, NJ, pp. 90-100.
21. [G85b] H. N. GABOW, Scaling algorithms for network problems, J. Comput. System Sci., 31 (1985), pp. 148-168.
22. [G95] A. V. GOLDBERG, Scaling algorithms for the shortest paths problem, SIAM J. Comput., 24 (1995), pp. 494-504.
23. [GM97] Z. GALIL AND O. MARGALIT, All pairs shortest distances for graphs with small integer length edges, Inform. and Comput., 134 (1997), pp. 103-139.
24. [GR98] A. V. GOLDBERG AND S. RAO, Beyond the flow decomposition barrier, J. ACM, 45 (1998), pp. 783-797.
25. [GT89] H. N. GABOW AND R. E. TARJAN, Faster scaling algorithms for network problems, SIAM J. Comput., 18 (1989), pp. 1013-1036.
26. [GT91] H. N. GABOW AND R. E. TARJAN, Faster scaling algorithms for general graph-matching problems, J. ACM, 38 (1991), pp. 815-853.
27. [GYY80] R. L. GRAHAM, A. C. YAO, AND F. F. YAO, Information bounds are weak in the shortest distance problem, J. ACM, 27 (1980), pp. 428-444.
28. [Hag00] T. HAGERUP, Improved shortest paths on the word RAM, in Proceedings of the 27th International Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Comput. Sci. 1853, Springer, New York, 2000, pp. 61-72.
29. [Hag04] T. HAGERUP, Simpler computation of single-source shortest paths in linear average time, in Proceedings in the 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS), Montpellier, France, 2004, Springer, New York, pp. 362-369.
30. [Han04] Y. HAN, Improved algorithm for all pairs shortest paths, Inform. Process. Lett., 91 (2004), pp. 245-250.
31. [HKRS97] M. R. HENZINGER, P. N. KLEIN, S. RAO, AND S. SUBRAMANIAN, Faster shortest path algorithms for planar graphs, J. Comput. System Sci., 55 (1997), pp. 3-23.
32. [HT02] Y. HAN AND M. THORUP, Integer sorting in O(n √log log n) expected time and linear space, in Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (FOCS), Vancouver, 2002, IEEE Press, Piscataway, NJ, pp. 135-144.
33. [J77] D. B. JOHNSON, Efficient algorithms for shortest paths in sparse networks, J. ACM, 24 (1977), pp. 1-13.
34. [K70] L. R. KERR, The Effect of Algebraic Structure on the Computational Complexity of Matrix Multiplication, Technical report TR70-75, Computer Science Department, Cornell University, Ithaca, NY, 1970.
35. [KKP93] D. R. KARGER, D. KOLLER, AND S. J. PHILLIPS, Finding the hidden path: Time bounds for all-pairs shortest paths, SIAM J. Comput., 22 (1993), pp. 1199-1217.
36. [KKT95] D. R. KARGER, P. N. KLEIN, AND R. E. TARJAN, A randomized linear-time algorithm for finding minimum spanning trees, J. ACM, 42 (1995), pp. 321-329.
37. [KS97] P. N. KLEIN AND S. SUBRAMANIAN, A randomized parallel algorithm for single-source shortest paths, J. Algorithms, 25 (1997), pp. 205-220.
38. 3) expected time, J. Algorithms, 28 (1998), pp. 125-141.
39. [LaP96] H. LAPOUTRÉ, Lower bounds for the union-find and the split-find problem on pointer machines, J. Comput. System Sci., 52 (1996), pp. 87-99.
40. [M01] U. MEYER, Single-source shortest-paths on arbitrary directed graphs in linear average-case time, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Washington, DC, 2001, SIAM, Philadelphia, pp. 797-806.
41. [M02] U. MEYER, Buckets strike back: Improved parallel shortest-paths, in Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS), Ft. Lauderdale, FL, 2002, IEEE Computer Society Press, Los Alamitos, CA, pp. 75-82.
42. [Mit00] J. S. B. MITCHELL, Geometric shortest paths and network optimization, in Handbook of Computational Geometry, North-Holland, Amsterdam, 2000, pp. 633-701.
43. [MN00] K. MEHLHORN AND S. NÄHER, LEDA: A Platform for Combinatorial and Geometric Computing, Cambridge University Press, Cambridge, UK, 2000.
44. 2 log n), SIAM J. Comput., 16 (1987), pp. 1023-1031.
45. [Pet02b] S. PETTIE, On the comparison-addition complexity of all-pairs shortest paths, in Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC'02), Vancouver, 2002, Springer, New York, pp. 32-43.
46. [Pet03] S. PETTIE, On the Shortest Path and Minimum Spanning Tree Problems, Ph.D. thesis, Department of Computer Sciences, The University of Texas at Austin, Austin, TX, 2003: also available online as Technical report TR-03-35 at http://www.cs.utexas.edu/ftp/pub/techreports/tr03-35.ps.gz.
47. [Pet04] S. PETTIE, A new approach to all-pairs shortest paths on real-weighted graphs, Special Issue of Selected Papers from the 29th International Colloqium on Automata Languages and Programming (ICALP 2002), Theoret. Comput. Sci., 312 (2004), pp. 47-74.
48. [PR02a] S. PETTIE AND V. RAMACHANDRAN, Computing shortest paths with comparisons and additions, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, 2002, SIAM, Philadelphia, pp. 267-276.
49. [PR02b] S. PETTIE AND V. RAMACHANDRAN, Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, 2002, SIAM, Philadelphia, pp. 713-722.
50. [PR02c] S. PETTIE AND V. RAMACHANDRAN, An optimal minimum spanning tree algorithm, J. ACM, 49 (2002), pp. 16-34.
51. [PRS02] S. PETTIE, V. RAMACHANDRAN, AND S. SRIDHAR, Experimental evaluation of a new shortest path algorithm, in Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX), San Francisco, CA, 2002, Springer, New York, pp. 126-142.
52. [Sei95] R. SEIDEL, On the all-pairs-shortest-path problem in unweighted undirected graphs, J. Comput. System Sci., 51 (1995), pp. 400-403.
53. [SP75] P. M. SPIRA AND A. PAN, On finding and updating spanning trees and shortest paths, SIAM J. Comput., 4 (1975), pp. 375-380.
54. 2 n), SIAM J. Comput., 2 (1973), pp. 28-32.
55. [SZ99] A. SHOSHAN AND U. ZWICK, All pairs shortest paths in undirected graphs with integer weights, in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), New York, 1999, IEEE Press, Piscataway, NJ, pp. 605-614.
56. [Tak92] T. TAKAOKA, A new upper bound on the complexity of the all pairs shortest path problem, Inform. Process. Lett., 43 (1992), pp. 195-199.
57. [Tak98] T. TAKAOKA, Subcubic cost algorithms for the all pairs shortest path problem, Algorithmica, 20 (1998), pp. 309-318.
58. [Tar79] R. E. TARJAN, A class of algorithms which require nonlinear time to maintain disjoint sets, J. Comput. System Sci., 18 (1979), pp. 110-127.
59. [Tar79b] R. E. TARJAN, Applications of path compression on balanced trees, J. ACM, 26 (1979), pp. 690-715.
60. [Tar82] R. E. TARJAN, Sensitivity analysis of minimum spanning trees and shortest path trees, Inform. Process. Lett., 14 (1982), pp. 30-33;
61. Corrigendum, Inform. Process. Lett., 23 (1986), p. 219.
62. [Tho00] M. THORUP, Floats, integers, and single source shortest paths, J. Algorithms, 35 (2000), pp. 189-201.
63. [Tho03] M. THORUP, Integer priority queues with decrease key in constant time and the single source shortest paths problem, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), San Diego, CA, 2003, ACM, New York, pp. 149-158.
64. [Tho99] M. THORUP, Undirected single-source shortest paths with positive integer weights in linear time, J. ACM, 46 (1999), pp. 362-394.
65. [TZ96] J. L. TRÄFF AND C. D. ZAROLIAGIS, A simple parallel algorithm for the single-source shortest path problem on planar digraphs, in Parallel Algorithms for Irregularly Structured Problems, Lecture Notes in Comput. Sci. 1117, Springer, New York, 1996, pp. 183-194.
66. [Z01] U. ZWICK, Exact and approximate distances in graphs - A survey, in Proceedings of the 9th European Symposium on Algorithms (ESA), University of Aarhus, Denmark, 2001, pp. 33-48; available online at http://www.cs.tau.ac.il/ ~zwick/.
67. [Z02] U. ZWICK, All pairs shortest paths using bridging sets and rectangular matrix multiplication, J. ACM, 49 (2002), pp. 289-317.
68. [Z04] U. ZWICK, A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths, in Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Comput. Sci. 3341, Springer, New York, 2004, pp. 921-932.