Sparse source-wise and pair-wise distance preservers

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 660-669

  Coppersmith, Don ^a   Elkin, Michael ^b  

^a IBM RESEARCH   (United States)

^b Yale University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; INTEGER PROGRAMMING; PARAMETER ESTIMATION; PROBLEM SOLVING; SET THEORY; VECTORS;

COMBINATORIAL STRUCTURES; DISTORTION EMBEDDINGS; PAIR-WISE DISTANCE PRESERVERS; SPARSE SOURCE-WISE PRESERVERS;

TREES (MATHEMATICS);

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

References (27)

1. N. Alon, R. Karp, D. Peleg, and D. West. A graphtheoretic game and its application to the k-server problem. SIAM Journal on Computing, 24:78-100, 1995.
2. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing, 28(1):263-277, 1998.
3. B. Awerbuch and D. Peleg. Network synchronization with polylogarithmic overhead. In Proc. 31st Symp. on Foundations of Computer Science, pages 514-522, 1990.
4. B. Awerbuch and D. Peleg. Routing with polynomial communication-space trade-off. SIAM J. Discrete Math., (5):151-162, 1992.
5. B. Awerbuch, D. Peleg, B. Patt-Shamir, and M. Saks. Adapting to asynchronous dynamic networks with polylogarithmic overhead. In Proc. 24th ACM Symp. on Theory of Computing, pages 557-570, 1992.
6. A. Balog and I. Barany. On the convex hull of the integer points in a disc. Discrete and Computational Geometry, 6:39-44, 1991.
7. I. Barany and D. G. Larman. The convex hull of the integer points in a large ball. Mathematische Annalen, (312):167-181, 1998.
8. S. Baswana, T. Kavitha, K. Mehlhorn, and S. Pettie. New constructions of (a,b)-spanners and additive spanners. In SODA: ACM-SIAM Symposium on Discrete Algorithms, 2005.
9. 1+1/k) size in weighted graphs. In Proc. of the 30th International Colloq. on Automata, Languages and Computing, ICALP 2003, pages 284-296, 2003.
10. B. Bollobas, D. Coppersmith, and M. Elkin. Sparse distance preservers and additive spanners. In Proc. of the 14th ACM-SIAM Symp. on Discrete algorithms, pages 414-423, 2003.
11. J. Bourgain. On Lipschitz embedding of finite metric space in Hubert space. Israel J. Math., 56:46-52, 1985.
12. E. Cohen. Fast algorithms for constructing t-spanners and paths of stretch t. In Proc. 34th IEEE Symp. on Foundations of Computer Science, pages 648-658, 1993.
13. D. Dor, D. Halperin, and U. Zwick. All pairs almost shortest paths. In Proc. 37th IEEE Symp. on Foundations of Computer Science, pages 452-461, 1997.
14. M. Elkin. Computing almost shortest paths. In Proc. 20th ACM Symp. on Principles of Distributed Computing, pages 53-63, 2001.
15. M. Elkin and D. Peleg. (1 + εβ)-spanner constructions for general graphs. In Proc. of the 33th ACM Symp. on Theory of Computing, pages 173-182, 2001.
16. C. Gavoille, D. Peleg, S. Perennes, and R. Raz. Distance labeling in graphs. In Proc. 12th ACM-SIAM Symp. on Discrete algorithms, pages 210-219, 2001.
17. G. H. Hardy and E. M. Wright. An Introduction to the Theory of Numbers. Oxford University Press, 1979.
18. P. Indyk and J. Matousek. Low Distortion Embeddings of Finite Metric Spaces: Chapter 8 in CRC Handbook of Discrete and Computational Geometry. 2004.
19. V. Jarnik. Uber Gitterpunkte und konvex Kurven. Math. Z., 2:500-518, 1925.
20. W. Johnson and J. Lindenstrauss. Extensions of Lipschitz embeddings into a Hubert space. Contempt. Math., 26:189-206, 1984.
21. Y. Mansour and D. Peleg. An approximation algorithm for minimum-cost network design. The Weizmann Institute of Science Technical Report, CS94-22, 1994.
22. J. Matousek. Lectures in Discrete Geometry: Graduate Texts in Mathematics, Springer, New York, volume 212. 2002.
23. D. Peleg. Proximity-preserving labeling schemes. Journal of Graph Theory, (33):167-176, 2000.
24. D. Peleg and A. Schäffer. Graph spanners. Journal of Graph Theory, 13:99-116, 1989.
25. D. Peleg and E. Upfal. A trade-off between space and efficiency for routing tables. Journal on ACM, 36(3):510-530, 1989.
26. L. Roditty, M. Thorup, and U. Zwick. Roundtrip spanners and roundtrip routing in directed graphs. In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, 2002.
27. M. Thorup and U. Zwick. Approximate distance oracles. In Proc. of the 38th ACM Symp. on Theory of Computing, pages 183-192, 2001.