All-pairs almost shortest paths

SIAM Journal on Computing

Volumn 29, Issue 5, 2000, Pages 1740-1759

  Dor, Dorit ^a   Halperin, Shay ^a   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOOLEAN ALGEBRA; MATRIX ALGEBRA;

BOOLEAN MATRIX MULTIPLICATION;

GRAPH THEORY;

EID: 0034544711     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797327908     Document Type: Article

References (33)

1. A. AHO, J. HOPCROFT, AND J. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. D. AINGWORTH, C. CHEKURI, P. INDYK, AND R. MOTWANI, Fast estimation of diameter and shortest paths (without matrix multiplication), SIAM J. Comput, 28 (1999), pp. 1167-1181.
3. 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.
4. N. ALON AND M. NAOR, Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions, Algorithmica, 16 (1996), pp. 434-449.
5. I. ALTHÖFER, G. DAS, D. DOBKIN, D. JOSEPH, AND J. SOARES, On sparse spanners of weighted graphs, Discrete Comput. Geom., 9 (1993), pp. 81-100.
6. B. AWERBUCH, Complexity of network synchronization, J. Assoc. Comput. Mach., 32 (1985), pp. 804-823.
7. B. AWERBUCH, B. BERGER, L. COWEN, AND D. PELEG, Near-linear time construction of sparse neighborhood covers, SIAM J. Comput., 28 (1999), pp. 263-277.
8. J. BASCH, S. KHANNA, AND R. MOTWANI, On Diameter Verification and Boolean Matrix Multiplication, Tech. Report STAN-CS-95-1544, Department of Computer Science, Stanford University, Stanford, CA, 1995.
9. V. CHVÁTAL, A greedy heuristic for the set-covering problem, Math. Oper. Res., 4 (1979), pp. 233-235.
10. E. COHEN, Polylog-time and near-linear work approximation scheme for undirected shortest paths, in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, Montréal, Canada, 1994, pp. 16-26.
11. E. COHEN, Fast algorithms for constructing t-spanners and paths with stretch t, SIAM J. Comput., 28 (1999), pp. 210-236.
12. E. COHEN AND U. ZWICK, All-pairs small-stretch paths, in Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, 1997, pp. 93-102.
13. D. COPPERSMITH AND S. WINOGRAD, Matrix multiplication via arithmetic progressions, J. Symbolic Comput., 9 (1990), pp. 251-280.
14. T. CORMEN, C. LEISERSON, AND R. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
15. E. DIJKSTRA, A note on two problems in connexion with graphs, Numer. Math., 1 (1959), pp. 269-271.
16. T. FEDER AND R. MOTWANI, Clique partitions, graph compression and speeding-up algorithms, J. Comput. System Sci., 51 (1995), pp. 261-272.
17. M. L. FREDMAN, New bounds on the complexity of the shortest path problem, SIAM J. Comput., 5 (1976), pp. 83-89.
18. M. FREDMAN AND R. TARJAN, Fibonacci heaps and their uses in improved network optimization algorithms, J. Assoc. Comput. Mach., 34 (1987), pp. 596-615.
19. Z. GALIL AND O. MARGALIT, Witnesses for boolean matrix multiplication, J. Complexity, 9 (1993), pp. 201-221.
20. Z. GALIL AND O. MARGALIT, All pairs shortest distances for graphs with small integer length edges, Inform. Comput., 134 (1997), pp. 103-139.
21. Z. GALIL AND O. MARGALIT, All pairs shortest paths for graphs with small integer length edges, J. Comput. System Sci., 54 (1997), pp. 243-254.
22. D. JOHNSON, Efficient algorithms for shortest paths in sparse graphs, J. Assoc. Comput. Mach., 24 (1977), pp. 1-13.
23. 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.
24. A. LIESTMAN AND T. SHERMER, Additive graph spanners, Networks, 23 (1993), pp. 343-363.
25. L. LOVÁSZ, On the ratio of optimal integral and fractional covers. Discrete Math., 13 (1975), pp. 383-390.
26. C. MCGEOCH, All-pairs shortest paths and the essential subgraph, Algorithmica, 13 (1995), pp. 426-461.
27. D. PELEG AND A. SCHÄFFER, Graph spanners, J. Graph Theory, 13 (1989), pp. 99-116.
28. R. SEIDEL, On the all-pairs-shortest-path problem in unweighted undirected graphs, J. Comput. System Sci., 51 (1995), pp. 400-403.
29. T. TAKAOKA, A new upper bound on the complexity of the all pairs shortest path problem, Inform. Process. Lett., 43 (1992), pp. 195-199.
30. M. THORUP, Undirected single source shortest paths in linear time, in Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, Miami Beach, FL, 1997, pp. 12-21.
31. J. D. ULLMAN AND M. YANNAKAKIS, High-probability parallel transitive-closure algorithms, SIAM J. Comput., 20 (1991), pp. 100-125.
32. 10's, J. Combin. Theory Ser. B, 52 (1991), pp. 113-116.
33. U. ZWICK, 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, CA, 1998, pp. 310-319.