Spanners and emulators with sublinear distance errors

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 802-809

  Thorup, Mikkel ^a   Zwick, Uri ^b  

^a AT AND T LABS RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; ERROR ANALYSIS; INTEGER PROGRAMMING; MATHEMATICAL MODELS;

EMULATORS; ERROR TERMS; SUBGRAPHS; VERTICES;

GRAPH THEORY;

EID: 33244495364     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109645     Document Type: Conference Paper

References (20)

1. D. Aingworth, G. Chekuri, P. Indyk, and R. Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM Journal on Computing, 28:1167-1181, 1999.
2. I. Althöfer, G. Das, D. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9:81-100, 1993.
3. B. Awerbuch. Complexity of network synchronization. Journal of the ACM, 32:804-823, 1985.
4. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing, 28:263-277, 1999.
5. B. Awerbuch and D. Peleg. Routing with polynomial communication-space trade-off. SIAM Journal on Discrete Mathematics, 5(2):151-162, 1992.
6. S. Baswana, T. Kavitha, K. Mehlhorn, and S. Pettie. New constructions of (α, β)-spanners and purely additive spanners. In Proc. of 16th SODA, pages 672-681, 2005.
7. 1+1/k) size for weighted graphs. In Proc. of 30th ICALP, pages 384-296, 2003.
8. B. Bollobás, D. Coppersmith, and M. Elkin. Sparse distance preservers find additive spanners. In Proc. of 14th SODA, pages 414-423, 2003.
9. E. Cohen. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM Journal on Computing, 28:210-236, 1999.
10. D. Coppersmith and M. Elkin. Sparse source-wise and pair-wise distance preservers. In Proc. of 16th SODA, pages 660-669, 2005.
11. L.J. Cowen. Compact routing with minimum stretch. Journal of Algorithms, 38:170-183, 2001.
12. D. Dor, S. Halperin, and U. Zwick. All pairs almost shortest paths. SIAM Journal on Computing, 29:1740-1759, 2000.
13. T. Eilam, C. Gavoille, and D. Peleg. Compact routing schemes with low stretch factor. In Proc. of 17th PODC, pages 11-20, 1998.
14. M. Elkin. Computing almost shortest paths. In Proc. of 20th PODC, pages 53-62, 2001.
15. M.L. Elkin and D. Peleg. (1 + ε, β)-Spanner constructions for general graphs. SIAM Journal on Computing, 33(3):608-631, 2004. (Announced in STOC'01).
16. D. Peleg and A.A. Schäffer. Graph spanners. Journal of Graph Theory, 13:99-116, 1989.
17. D. Peleg and E. Upfal. A trade-off between space and efficiency for routing tables. Journal of the ACM, 36(3):510-530, 1989.
18. L. Roditty, M. Thorup, and U. Zwick. Deterministic constructions of approximate distance oracles and spanners. In Proc. of 32th ICALP, pages 261-272, 2005.
19. M. Thorup and U. Zwick. Compact routing schemes. In Porceedings of the 13th SPAA, pages 1-10, 2001.
20. M. Thorup and U. Zwick. Approximate distance oracles. Journal of the ACM, 52(1):1-24, 2005. (Announced in STOC'01).