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

Theoretical Computer Science

Volumn 410, Issue 1, 2009, Pages 84-93

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

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b PERSISTENT SYSTEMS LTD   (India)

^c INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

Distance; Shortest path; Spanner

Indexed keywords

DISTANCE; RANDOMIZED ALGORITHMS; SHORTEST PATH; SPANNER; UNDIRECTED GRAPHS;

WIRELESS SENSOR NETWORKS;

EID: 58049206650     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.10.018     Document Type: Article

References (22)

1. Aingworth D., Chekuri C., Indyk P., and Motwani R. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM Journal on Computing 28 (1999) 1167-1181
2. Alon N., Galil Z., and Margalit O. On the exponent of the all-pairs shortest paths problem. Journal of Computer and System Sciences 54 (1997) 255-262
3. Awerbuch B., Berger B., Cowen L., and Peleg D. Near-linear time construction of sparse neighborhod covers. SIAM Journal on Computing 28 (1998) 263-277
4. S. Baswana, T. Kavitha, Faster algorithms for approximate distance oracles and all-pairs small stretch paths, in: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS, 2007, pp. 591-602
5. 2) time, in: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, SODA, 2004, pp. 271-280
6. Berman P., and Kasiviswanathan S.P. Faster approximation of distances in graphs. Proceedings of 10th Workshop on Algorithms and Data Structures. LNCS vol. 4619 (2007), Springer 541-552
7. T.M. Chan, More algorithms for all-pairs shortest paths in weighted graphs, in: Proceedings of 39th Annual ACM Symposium on Theory of Computing, 2007, pp. 590-598
8. Cohen E. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM Journal on Computing 28 (1999) 210-236
9. Cohen E. Polylog-time and near-linear work approximation scheme for undirected shortest paths. Journal of Association of Computing Machinery 47 (2000) 132-166
10. Cohen E., and Zwick U. All-pairs small stretch paths. Journal of Algorithms 38 (2001) 335-353
11. Coppersmith D., and Winograd S. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9 (1990) 251-280
12. Dor D., Halperin S., and Zwick U. All pairs almost shortest paths. SIAM Journal on Computing 29 (2000) 1740-1759
13. Elkin M. Computing almost shortest paths. ACM Transactions on Algorithms 1 (2005) 282-323
14. Pettie S. A new approach to all-pairs shortest paths on real-weighted graphs. Theoretical Computer Science 312 (2004) 47-74
15. Roditty L., Thorup M., and Zwick U. Deterministic construction of approximate distance oracles and spanners. Proceedings of 32nd International Colloquim on Automata, Languages and Programming. LNCS vol. 3580 (2005), Springer 261-272
16. A. Shoshan, U. Zwick, All pairs shortest paths in undirected graphs with integer weights, in: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, FOCS, 1999, pp. 605-615
17. Strassen V. Gaussian elimination is not optimal. Numerische Mathematik 13 (1969) 354-356
18. Takaoka T. Subcubic cost algorithms for the all pairs shortest path problem. Algorithmica 20 (1998) 309-318
19. M. Thorup, U. Zwick, Compact routing schemes, in: Proceedings of 13th ACM Symposium on Parallel Algorithms and Architecture, 2001, pp. 1-10
20. Thorup M., and Zwick U. Approximate distance oracles. Journal of Association of Computing Machinery 52 (2005) 1-24
21. U. Zwick, Exact and approximate distances in graphs - A survey, in: Proceedings of the 9th Annual European Symposium on Algorithms, ESA, 2001, pp. 33-48
22. Zwick U. All-pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of Association of Computing Machinery 49 (2002) 289-317