All Pairs Shortest Paths using bridging sets and rectangular matrix multiplication

Journal of the ACM

Volumn 49, Issue 3, 2002, Pages 289-317

  Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Matrix multiplication; Shortest paths

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; PARAMETER ESTIMATION; PROBLEM SOLVING; SET THEORY;

ALL PAIRS SHORTEST PATHS (APSP); BRIDGING SETS; EDGE WEIGHTS; INTEGERS;

MATRIX ALGEBRA;

EID: 0012584372     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/567112.567114     Document Type: Article

References (35)

1. AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.
2. AINGWORTH, D., CHEKURI, C., INDYK, P., AND MOTWANI, R. 1999. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput. 28, 1167-1181.
3. ALON, N., GAUL, Z., AND MARGALIT, O. 1997. On the exponent of the all pairs shortest path problem. J. Comput. Syst. Sci. 54, 255-262.
4. ALON, N., AND NAOR, M. 1996. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16, 434-449.
5. BURGISSER, P., CLAUSEN, M., AND SHOKROLLAHI, M. A. 1997. Algebraic Complexity Theory. Springer-Verlag, New York.
6. CHVÁTAL, V. 1979. A greedy heuristic for the set-covering problem. Math. Oper. Res. 4, 233-235.
7. COHEN, E., AND ZWICK, U. 2001. All-pairs small-stretch paths. J. Algorithms 38, 335-353.
8. COPPERSMITH, D. 1997. Rectangular matrix multiplication revisited. J. Complex. 13, 42-49.
9. COPPERSMITH, D., AND WINOGRAD, S. 1990. Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9, 251-280.
10. CORMEN, T. H., LEISERSON, C. E., RIVEST, R. L., AND STEIN, C. 2001. Introduction to Algorithms, 2nd ed. The MIT Press, Cambridge, Mass.
11. DIJKSTRA, E. W. 1959. A note on two problems in connexion with graphs. Num. Math. 1, 269-271.
12. DOR, D., HALPERIN, S., AND ZWICK, U. 2000. All pairs almost shortest paths. SIAM J. Comput. 29, 1740-1759.
13. FREDMAN, M. L. 1976. New bounds on the complexity of the shortest path problem. SIAM J. Comput. 5, 49-60.
14. FREDMAN, M. L., AND TARJAN, R. E. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596-615.
15. GALIL, Z., AND MARGALIT, O. 1993. Witnesses for Boolean matrix multiplication. J. Complex. 9, 201-221.
16. GALIL, Z., AND MARGALIT, O. 1997. All pairs shortest distances for graphs with small integer length edges. Inf. Comput. 134, 103-139.
17. GALIL, Z., AND MARGALIT, O. 1997b. All pairs shortest paths for graphs with small integer length edges. J. Comput. Syst. Sci. 54, 243-254.
18. HENZINGER, M. R., AND KING, V. 1995. Fully dynamic biconnectivity and transitive closure. In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science (Milwaukee, Wis). IEEE Computer Society Press, Los Alamitos, Calif., pp. 664-672.
19. HUANG, X., AND PAN, V. Y. 1998. Fast rectangular matrix multiplications and applications. J. Complex. 14, 257-299.
20. JOHNSON, D. B. 1977. Efficient algorithms for shortest paths in sparse graphs. J. ACM 24, 1-13.
21. KARGER, D. R., KOLLER, D., AND PHILLIPS, S. J. 1993. Finding the hidden path: Time bounds for all-pairs shortest paths. SIAM J. Comput. 22, 1199-1217.
22. LOVÁSZ, L. 1975. On the ratio of optimal integral and fractional covers. Disc. Math. 13, 383-390.
23. MCGEOCH, C. C. 1995. All-pairs shortest paths and the essential subgraph. Algorithmica 13, 426-461.
24. PAN, V. 1985. How to Multiply Matrices Faster. Lecture Notes in Computer Science, Vol. 179. Springer-Verlag, New York.
25. SCHÖNHAGE, A., AND STRASSEN, V. 1971. Schnelle multiplikation grosser zahlen. Computing 7, 281-292.
26. SEIDEL, R. 1995. On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. Syst. Sci. 51, 400-403.
27. SHOSHAN, A., AND ZWICK, U. 1999. All pairs shortest paths in undirected graphs with integer weights. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (New York, New York). IEEE Computer Society Press, Los Alamitos, Calif., pp. 605-614.
28. TAKAOKA, T. 1992. A new upper bound on the complexity of the all pairs shortest path problem. Inf. Proc. Lett. 43, 195-199.
29. TAKAOKA, T. 1998. Subcubic cost algorithms for the all pairs shortest path problem. Algorithmica 20, 309-318.
30. THORUP, M. 1999. Undirected single-source shortest paths with positive integer weights in linear time. J. ACM 46, 362-394.
31. THORUP, M. 2000. Floats, integers, and single source shortest paths. J. Algorithms 35, 189-201.
32. ULLMAN, J. D., AND YANNAKAKIS, M. 1991. High-probability parallel transitive-closure algorithms. SIAM J. Comput. 20, 100-125.
33. 2.81 infinite-precision multiplications. Inf. Proc. Lett. 4, 155-156.
34. ZWICK, U. 1998. All pairs shortest paths in weighted directed graphs - Exact and almost exact algorithms. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (Palo Alto, Calif.). IEEE Computer Society Press, Los Alamitos, Calif., pp. 310-319.
35. ZWICK, U. 1999. All pairs lightest shortest paths. In Proceedings of the 31th Annual ACM Symposium on Theory of Computing (Atlanta, Ga.). ACM, New York, pp. 61-69.