Sparse distance preservers and additive spanners

SIAM Journal on Discrete Mathematics

Volumn 19, Issue 4, 2005, Pages 1029-1055

  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 BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Distance preservation; Graph theory; Spanners

Indexed keywords

DISTANCE PRESERVATION; SPANNERS;

COMPUTATION THEORY; NUMBERING SYSTEMS; NUMERICAL METHODS;

GRAPH THEORY;

EID: 33751197482     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480103431046     Document Type: Article

References (26)

1. 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.
2. B. AWERBUCH AND D. PELEG, Sparse partitions, in Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, 1990, pp. 503-513.
3. B. AWERBUCH AND D. PELEG, Network synchronization with polylogarithmic overhead, in Proceedings of the 31st Annual Symposium on Foundations of Computer Science, IEEE, 1990, pp. 514-522.
4. B. AWERBUCH, B. BERGER, L. COWEN, AND D. PELEG, Near-linear time construction of sparse neighborhood covers, SIAM J. Comput., 28 (1998), pp. 263-277.
5. B. BOLLOBÁS, Modern Graph Theory, Graduate Texts in Mathematics 184, Springer-Verlag, New York, 1998, pp. xiv+394.
6. B. BOLLOBÁS, D. COPPERSMITH, AND M. L. ELKIN, Sparse distance preservers and additive spanners, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 2003, pp. 414-423.
7. S. BASWANA, T. KAVITHA, K. MEHLHORN, AND S. PETTIE, New constructions of (α,β)-spanners and purely additive spanners, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, Vancouver, BC, Canada, 2005, pp. 672-681.
8. J. A. BONDY AND M. SIMONOVITS, Cycles of even length in graphs, J. Combin. Theory Ser. B, 16 (1974), pp. 97-105.
9. B. CHANDRA, G. DAS, G. NARASIMHAN, AND J. SOARES, New sparseness results on graph spanners, in Proceedings of the 8th Annual ACM Symposium on Computational Geometry, Berlin, 1992, pp. 192-201.
10. L. P. CHEW, There is a planar graph almost as good as the complete graph, in 2nd Annual Symposium on Computational Geometry, Yorktown Heights, NY, 1986, pp. 169-177.
11. E. COHEN, Fast Algorithms for constructing t-spanners and paths of stretch t, in Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, Palo Alto, CA, pp. 648-658.
12. 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 Computation, Montreal, Canada, 1994, pp. 16-26.
13. D. P. DOBKIN, S. J. FRIEDMAN, AND K. J. SUPOWIT, Delaunay graphs are almost as good as complete graphs, Discrete Comput. Geom., 5 (1990), pp. 399-407.
14. M. L. ELKIN, Computing almost shortest paths, in Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, Newport, RI, 2001, pp. 53-63.
15. M. L. ELKIN AND D. PELEG, (1 + ∈,β)-spanner constructions for general graphs, SIAM J. Comput., 33 (2004), pp. 608-631.
16. See also Proc. 33rd ACM Symp. on Theory of Computing, Crete, Greece, 2001, pp. 173-182.
17. T. FEDER AND R. MOTWANI, Clique partitions, graph compression and speeding-up algorithms, Special Issue for the STOC conference, J. Comput. System Sci., 51 (1995), pp. 261-272.
18. C. GAVOILLE, D. PELEG, S. PERENNES, AND R. RAZ, Distance labeling in graphs, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, 2001, pp. 210-219.
19. R. L. GRAHAM, B. L. ROTHSCHIELD, AND J. H. SPENCER, Ramsey Theory, 2nd ed., Wiley-Interscience Series in Discrete Mathematics and Optimization, A Wiley-Interscience Publication, John Wiley & Sons, Inc., New York, 1990, pp. xii+196.
20. D. PELEG, Proximity-preserving labeling schemes, J. Graph Theory, 33 (2000), pp. 167-176.
21. D. PELEG AND A. SCHÄFFER, Graph spanners, J. Graph Theory, 13 (1989), pp. 99-116.
22. D. PELEG AND J. D. ULLMAN, An optimal synchronizer for the hypercube, SIAM J. Comput., 18 (1989), pp. 740-747.
23. M. THORUP, private communication, Oct. 2001.
24. M. THORUP, Compact oracles for reachability and approximate distances in planar digraphs,in Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, Las Vegas, NV, 2001.
25. M. THORUP AND U. ZWICK, Approximate distance oracles, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, Crete, Greece, 2001, pp. 183-192.
26. J. D. ULLMAN AND M. YANNAKAKIS, High-probability parallel transitive-closure-algorithms, SIAM J. Comput., 20 (1991), pp. 100-125.