A new approach to all-pairs shortest paths on real-weighted graphs

Theoretical Computer Science

Volumn 312, Issue 1, 2004, Pages 47-74

  Pettie, Seth ^a  

^a University of Texas at Austin   (United States)

Author keywords

All pairs shortest paths; Comparison addition model; Real weights

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; GRAPH THEORY;

ALL-PAIRS SHORTEST PATHS; REAL WEIGHT;

COMPUTER SCIENCE;

EID: 0346339721     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00402-X     Document Type: Conference Paper

References (38)

1. Ahuja R.K., Mehlhorn K., Orlin J.B., Tarjan R.E. Faster algorithms for the shortest path problem. J. ACM. 37(2):1990;213-223.
2. Alon N., Galil Z., Margalit O. On the exponent of the all pairs shortest path problem. J. Comput. System Sci. 54(2, Part 1):1997;255-262.
3. Chazelle B. A minimum spanning tree algorithm with inverse-Ackermann type complexity. J. ACM. 47(6):2000;1028-1047.
4. Cormen T.H., Leiserson C.E., Rivest R.L., Stein C. Introduction to Algorithms. 2001;MIT Press, Cambridge, MA.
5. Dijkstra E.W. A note on two problems in connexion with graphs. Numer. Math. 1:1959;269-271.
6. E.A. Dinic, Economical algorithms for finding shortest paths in a network, in: Y.S. Popkov, B.L. Shmulyian (Eds.), Transportation Modeling Systems, Institute for system studies, Moscow, 1978, pp. 36-44.
7. Fredman M.L. New bounds on the complexity of the shortest path problem. SIAM J. Comput. 5(1):1976;83-89.
8. Fredman M.L., Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithm. J. ACM. 34(3):1987;596-615.
9. H.N. Gabow, A scaling algorithm for weighted matching on general graphs, in: Proc. 26th Annu. Symp. on Foundations of Computer Science (FOCS'85), 1985, pp. 90-100.
10. Gabow H.N., Tarjan R.E. Faster scaling algorithms for network problems. SIAM J. Comput. 18(5):1989;1013-1036.
11. Galil Z., Margalit O. All pairs shortest distances for graphs with small integer length edges. Inform. and Comput. 134(2):1997;103-139.
12. Goldberg A.V. Scaling algorithms for the shortest paths problem. SIAM J. Comput. 24(3):1995;494-504.
13. Graham R.L., Yao A.C., Yao F.F. Information bounds are weak in the shortest distance problem. J. ACM. 27(3):1980;428-444.
14. Y. Han, Improved fast integer sorting in linear space, in: Proc. 12th Annu. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2001, pp. 793-796.
15. Y. Han, Deterministic sorting in O(n log log n) time and linear space, in: 34th Annu. ACM Symp. on Theory of Computing, ACM Press, New York, 2002, pp. 602-608.
16. Y. Han, M. Thorup, Integer sorting in O(n log log n ) expected time and linear space, in: 43rd Annu. Symp. on Foundation of Computer Science, 2002, pp. 135-144.
17. T. Hagerup, Improved shortest paths on the word RAM, in: Proc. 27th Internat. Colloq. on Automata, Languages, and Programming (ICALP'00), Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, 2000, pp. 61-72.
18. Johnson D.B. Efficient algorithms for shortest paths in sparse networks. J. ACM. 24(1):1977;1-13.
19. Karger D.R., Koller D., Phillips S.J. Finding the hidden path. time bounds for all-pairs shortest paths SIAM J. Comput. 22(6):1993;1199-1217.
20. L.R. Kerr, The effect of algebraic structure on the computational complexity of matrix multiplication, Tech. Report TR70-75, Computer Science Department, Cornell University, June 1970.
21. 3) expected time J. Algorithms. 28(1):1998;125-141.
22. S. Pettie, On the comparison-addition complexity of all-pairs shortest paths, in: Proc. 13th Internat. Symp. on Algorithms and Computation (ISAAC'02), 2002, pp. 32-43.
23. S. Pettie, An inverse-Ackermann style lower bound for the online minimum spanning tree verification problem, in: Proc. 43rd Annu. Symp. on Found. of Computer Science (FOCS'02), 2002, pp. 155-163.
24. Pettie S., Ramachandran V. An optimal minimum spanning tree algorithm. J. ACM. 49(1):2002;16-34.
25. S. Pettie, V. Ramachandran, S. Sridhar, Experimental evaluation of a new shortest path algorithm, in: 4th Workshop on Algorithm Engineering and Experiments (ALENEX), 2002, pp. 126-142.
26. S. Pettie, V. Ramachandran, Computing shortest paths with comparisons and additions, in: Proc. 13th Annu. ACM-SIAM Symp. on Discrete Algorithms (SODA'02), 2002, pp. 267-276.
27. S. Pettie, V. Ramachandran, A shortest path algorithm for real-weighted undirected graphs, submitted. A preliminary version appeared in 13th ACM-SIAM Symp. on Discrete Algorithms 2002, pp. 267-276.
28. Seidel R. On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. System Sci. 51(3):1995;400-403.
29. A. Shoshan, U. Zwick, All pairs shortest paths in undirected graphs with integer weights, in: 40th Annu. Symp. on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Silver Spring, MD, 1999, pp. 605-614.
30. Spira P.M., Pan A. On finding and updating spanning trees and shortest paths. SIAM J. Comput. 4(3):1975;375-380.
31. Tarjan R.E. A class of algorithms which require nonlinear time to maintain disjoint sets. J. Comput. System Sci. 18(2):1979;110-127.
32. Takaoka T. A new upper bound on the complexity of the all pairs shortest path problem. Inform. Process. Lett. 43(4):1992;195-199.
33. Thorup M. Undirected single-source shortest paths with positive integer weights in linear time. J. ACM. 46(3):1999;362-394.
34. M. Thorup, Equivalence between priority queues and sorting, in: 43rd Annu. Symp. on Foundation of Computer Science, 2002, pp. 125-134.
35. M. Thorup, Integer priority queues with decrease key in constant time and the single source shortest paths problem, in: 35th Annu. ACM Symp. on Theory of Computers, 2003, pp. 149-158.
36. van Emde Boas P., Kaas R., Zijlstra E. Design and implementation of an efficient priority queue. Math. Systems Theory. 10:1977;99-127.
37. U. Zwick, Exact and approximate distances in graphs - a survey, in: Proc. 9th European Symp. on Algorithms (ESA), 2001, pp. 33-48.
38. Zwick U. All pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM. 49(3):2002;289-317.