Sparse distance preservers and additive spanners

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 414-423

  Bollobás, Béla ^a,b,c   Coppersmith, Don ^d   Elkin, Michael ^e  

^a MICROSOFT RESEARCH   (United States)

^b University of Memphis   (United States)

^c TRINITY COLLEGE   (United Kingdom)

^d IBM RESEARCH   (United States)

^e INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; RANDOM PROCESSES; THEOREM PROVING;

ADDITIVE SPANNERS; DISTANCE LABELING SCHEME; SPARSE DISTANCE PRESERVERS; STEINER GRAPH; UNWEIGHTED GRAPH;

GRAPH THEORY;

EID: 0037739977     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. I. Althöfer, G. Das, D. Dobkin, D. Joseph and J. Soares, On sparse spanners of weighted graphs,Discrete & Computational Geometry 9, (1993), 81-100.
2. B. Awerbuch and D. Peleg, Sparse partitions, Proc. 31st IEEE Symp. on Foundations of Computer Science, 503-513, October 1990.
3. B. Awerbuch and D. Peleg. Network synchronization with polylogarithmic overhead, In Proc. 31st Symp. on Foundations of Computer Science, pp. 514-522, October, 1990.
4. B. Awerbuch, B. Berger, L. Cowen, D. Peleg, Near-linear time construction of sparse neighborhood covers, SIAM Journal of Computing, Vol. 28, 1, 263-277, 1998.
5. Bollobás, B., Modern Graph Theory, Graduate Texts in Mathematics, vol. 184, Springer-Verlag, New York, 1998, xiv+394 pp. (OR, Second Edition, 2002)
6. Bollobás, B., Random Graphs, Second Edition, Cambridge Studies in Advanced Mathematics 73, Cambridge University Press, Cambridge, 2001, xviii+498 pp.
7. B. Chandra, G. Das, G. Narasimhan and J. Soares, New sparseness results on graph spanners, Proc. 8th ACM Symp. on Computat. Geometry, 192-201, 1992.
8. L. P. Chew, There is a planar graph almost as good as the complete graph, 2nd Symp. on Computational Geometry, pages 169-177, 1986.
9. E. Cohen, Fast Algorithms for constructing t-spanners and paths of stretch t, in Proc. 34th IEEE Symp. on Foundations of Computer Science, IEEE, Piscataway, NJ, 1993, 648-658.
10. E. Cohen, Polylog-time and near-linear work approximation scheme for undirected shortest paths, in Proc. of 26th ACM Symp. on Theory of Computation, pp. 16-26, 1994.
11. D. P. Dobkin, S. J. Friedman and K.J. Supowit, Delaunay graphs are almost as good as complete graphs, Proc. 31st IEEE Symp. on Foundations of Computer Science, 1987, 20-26.
12. D. Dor, S. Halperin, U. Zwick, All pairs almost shortest paths, SIAM Journal on Computing, 29 (2000), pp. 1740-1759.
13. M. L. Elkin, Computing Almost Shortest Paths, in Proc. 20th ACM Symp. on Principles of Distributed Computing, pp.53-63, Newport, Rhode Island, August, 2001.
14. M. L. Elkin and D. Peleg. (1 + ε, β)-Spanner Constructions for General Graphs, Proc. 33rd ACM Symp. on Theory of Computing, pp. 173-182, Crete, Greece, July, 2001.
15. T. Feder and R. Motwani. Clique Partitions, Graph Compression and Speeding-up Algorithms. Special Issue for the STOC conference, Journal of Computer and System Sciences, 51 (1995):261-272.
16. C. Gavoille, D. Peleg, S. Perennes, R. Raz. Distance labeling in graphs. Proc. to 12th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 210-219, Washington, DC, USA, January, 2001.
17. R. L. Graham, B. L. Rothschield, J. H. Spencer, Ramsey Theory, Second Edition, Wiley-Interscience series in Discrete Mathematics and Optimization, A Wiley-Interscience Publications, John Wiley & Sons, Inc., New York, 1990, xii+196 pp.
18. D. Peleg, Distributed computing: a locality-sensitive approach, SIAM, Philadelphia, PA, 2000.
19. D. Peleg, Proximity-preserving labeling schemes, J. Graph Theory, 33:167-176, 2000.
20. D. Peleg and A. Schäffer. Graph Spanners, Journal of Graph Theory 13 (1989), 99-116.
21. D. Peleg and J. D. Ullman, An optimal synchronizer for the hypercube, SIAM J. Computing 18, (1989), 740-747.
22. M. Thorup, Oct. 2001, private communication.
23. M. Thorup, Compact Oracles for Reachability and Approximate Distances on Planar Digraphs, Proc. 42nd Annual Symp. on Foundations of Computer Science, Las Vegas, Nevada, Oct., 2001.
24. M. Thorup and U. Zwick, Approximate Distance Oracles, Proc. 33rd ACM Symp. on Theory of Computing, pp. 183-192, Crete, Greece, July 2001.
25. J. D. Ullman, M. Yannakakis, High-Probability Parallel Transitive-Closure-Algorithms. SIAM J. Comput. 20(1): 100-125 (1991).