All-pairs nearly 2-approximate shortest-paths in O(n2 polylogn) time

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 666-679

  Baswana, Surender ^a   Goyal, Vishrut ^b   Sen, Sandeep ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b PERSISTENT SYSTEMS LTD   (India)

^c INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; COMPUTER SCIENCE;

SHORTEST PATHS; TIME ALGORITHMS; VERTICES;

ALGORITHMS;

EID: 24144456144     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_55     Document Type: Conference Paper

References (10)

1. 2) time. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 271-280, 2004.
2. E. Cohen and U. Zwick. All-pairs small stretch paths. Journal of Algorithms, 38:335-353, 2001.
3. D. Dor, S. Halperin, and U. Zwick. All pairs almost shortest paths. Siam Journal on Computing, 29:1740-1759, 2000.
4. M. Elkin. Computing almost shortest paths. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, pages 53-62, 2001.
5. M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with o(1) worst case time. Journal of ACM, 31:538-544, 1984.
6. S. Pettie. A new approach to all-pairs shortest paths on real-weighted graphs. Theoretical Computer Science, 312:47-74, 2004.
7. M. Thorup and U. Zwick. Approximate distance oracle. In Proceedings of 33rd ACM Symposium on Theory of Computing (STOC), pages 183-192, 2001.
8. M. Thorup and U. Zwick. Compact routing schemes. In 13th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 1-10, 2001.
9. U. Zwick. Exact and approximate distances in graphs - a survey. In Proceedings of the 9th Annual European Symposium on Algorithms (ESA), pages 33-48, 2001.
10. U. Zwick. Slightly improved sub-cubic bound for computing all-pairs shortest paths. In 15th Annual International Symposium on Algorithms and Computation (ISAAC), to appear, 2004.