More algorithms for all-pairs shortest paths in weighted graphs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 590-598

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Computational geometry; Graph algorithms; Matrix multiplication; Shortest paths

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; INTEGER PROGRAMMING; PROBLEM SOLVING;

EUCLIDEAN SPACE; FAST MATRIX MULTIPLICATION; GRAPH ALGORITHMS; MATRIX MULTIPLICATION;

GRAPH THEORY;

EID: 35448979108     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250877     Document Type: Conference Paper

References (38)

1. P. K. Agarwal and J. Matoušek. On range searching with semialgebraic sets. Discrete Comput. Geom., 11:393-418, 1994.
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
3. S. Albers and T. Hagerup. Improved parallel integer sorting without concurrent writing. Inf. Comput., 136:25-51, 1997.
4. N. Alon, Z. Galil, and O. Margalit. On the exponent of the all pairs shortest path problem. J. Comput. Sys. Sci., 54:255-262, 1997. Preliminary version at FOCS 1991.
5. N. Alon, R. Yuster, and U. Zwick. Color-coding. J. ACM, 42:844-856, 1995.
6. V. L. Arlazarov, E. C. Dinic, M. A. Kronrod, and I. A. Faradzev. On economical construction of the transitive closure of a directed graph. Soviet Math. Dokl., 11:1209-1210, 1970.
7. T. M. Chan. Dynamic subgraph connectivity with geometric applications. In Proc. 34th ACM Sympos. Theory Comput., pages 7-13, 2002. SIAM J. Comput., to appear.
8. 3/log n) time. In Proc. 9th Workshop Algorithms Data Struct., Lect. Notes Comput. Sci., vol. 3608, Springer-Verlag, pages 318-324, 2005. Algorithmica, to appear.
9. T. M. Chan. All-pairs shortest paths for unweighted undirected graphs in o(mn) time. In Proc. 17th ACM-SIAM Sympos. Discrete Algorithms, pages 514-523, 2006.
10. T. M. Chan and Alon Efrat. Fly cheaply: on the minimum fuel consumption problem. J. Algorithms, 41(2):330-337, 2001.
11. B. Chazelle. Cuttings. In Handbook of Data Structures and Applications, CRC Press, pages 25.1-25.10, 2005.
12. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. McGraw-Hill, 2nd ed., 2001.
13. A. Czumaj and A. Lingas. Finding a heaviest triangle is not harder than matrix multiplication. In Proc. 18th ACM-SIAM Sympos. Discrete Algorithms, 2007.
14. W. Dobosiewicz. A more efficient algorithm for the min-plus multiplication. Int. J. Computer Math., 32:49-60, 1990.
15. T. Feder and R. Motwani. Clique partitions, graph compression and speeding-up algorithms. J. Comput. Sys. Sci., 51:261-272, 1995. Preliminary version at STOC 1991.
16. M. L. Fredman. New bounds on the complexity of the shortest path problem. SIAM J. Comput., 5:49-60, 1976.
17. Y. Han. Improved algorithm for all pairs shortest paths. Inform. Process. Lett., 91:245-250, 2004.
18. 5/4) time algorithm for all pairs shortest paths. In Proc. 14th European Sympos. Algorithms, Lect. Notes Comput. Sci., vol. 4168, Springer-Verlag, pages 411-417, 2006.
19. H. Kaplan, N. Rubin, M. Sharir, and E. Verbin. Counting colors in boxes. In Proc. 18th ACM-SIAM Sympos. Discrete Algorithms, 2007.
20. H. Kaplan, M. Sharir, and E. Verbin. Colored intersection searching via sparse rectangular matrix multiplication. In Proc. 22nd A CM Sympos. Comput. Geom., pages 52-60, 2006.
21. V. Koltun. Almost tight upper bounds for vertical decompositions in four dimensions. J. ACM, 51:699-730, 2004.
22. n. Inform. Process. Lett., 38:277-278, 1991.
23. J. Matoušek. Efficient partition trees. Discrete Comput. Geom., 8:315-334, 1992.
24. K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, N.J., 1994.
25. G. Narasimhan and M. Smid. Approximating the stretch factor of Euclidean graphs. SIAM J. Comput., 39:978-989, 2000.
26. S. Pettie. A new approach to all-pairs shortest paths on real-weighted graphs. Theoret. Comput. Sci., 312:47-74, 2004.
27. S. Pettie and V. Ramachandran. A shortest path algorithm for real-weighted undirected graphs. SIAM J. Comput., 34:1398-1431, 2005.
28. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
29. R. Sedgewick and J. S. Vitter. Shortest paths in Euclidean graphs. Algorithmica, 1:31-48, 1986.
30. R. Seidel. On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. Sys. Sci., 51:400-403, 1995. Preliminary version at STOC 1992.
31. A. Shoshan and U. Zwick. All pairs shortest paths in undirected graphs with integer weights. In Proc. 40th IEEE Sympos. Found. Comput. Sci., pages 605-614, 1999.
32. T. Takaoka. A new upper bound on the complexity of the all pairs shortest path problem. Inform. Process. Lett., 43:195-199, 1992.
33. T. Takaoka. A faster algorithm for the all-pairs shortest path problem and its application. In Proc. 10th Int. Conf. Comput. Comb., Lect. Notes Comput. Sci., vol. 3106, Springer-Verlag, pages 278-289, 2004.
34. 3-δ time, with applications. In Proc. 38th ACM Sympos. Theory Comput., pages 225-231, 2006.
35. V. Vassilevska, R. Williams, and R. Yuster. Finding the smallest H-subgraph in real weighted graphs and related problems. In Proc. 33rd Int. Colloq. Automata, Languages, and Programming, Lect. Notes Comput. Sci., vol. 4051, Springer-Verlag, pages 262-273, 2006.
36. U. Zwick. All pairs lightest shortest paths. In Proc. 31st ACM Sympos. Theory Comput., pages 61-69, 1999.
37. U. Zwick. All-pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM, 49:289-317, 2002.
38. U. Zwick. A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths. In Proc. 15th Int. Sympos. Algorithms and Computation, Lect. Notes Comput. Sci., vol. 3341, Springer-Verlag, pages 921-932, 2004. Algorithmica, 46:181-192, 2006.