Lower bounds for additive spanners, emulators, and more

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 389-398

  Woodruff, David P ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVE SPANNER; GRAPH EMULATORS; SOURCE-WISE DISTANCE;

PARAMETERIZATION; RELAXATION PROCESSES;

GRAPH THEORY;

EID: 38749097767     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.45     Document Type: Conference Paper

References (28)

1. D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput, pages 1167-1181, 1999.
2. I. Althofer, 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. JACM, pages 804-823, 1985.
4. S. Baswana, T. Kavitha, K. Mehlhorn, and S. Pettie. New constructions of (α, β)-spanners and purely additive spanners. In SODA, 2005.
5. 2 log n) time. In SODA, 2004.
6. S. Bhatt, F. Chung, J. Hong, F. Leighton, B. Obrenić, A. Rosenberg, and E. Schwabe. Optimal emulations by butterfly-like networks. JACM, 43(2):293-330, 1996.
7. B. Bollobás, D. Coppersmith, and M. Elkin. Sparse distance preservers and additive spanners. In SODA, pages 414-423, 2003.
8. E. Cohen. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. Comput., 28:210-236, 1998.
9. E. Cohen. Polylog-time and near-linear work approximation scheme for undirected shortest-paths. J. ACM, 47:132-166, 2000.
10. D. Coppersmith and M. Elkin. Sparse source-wise and pair-wise preservers. In SIAM Journal of Discrete Mathematics, 2005.
11. L. Cowen. Compact routing with minimum stretch. J. Algorithms, 28:170-183, 2001.
12. L. Cowen and C. Wagner. Compact roundtrip routing in directed networks. J. Algorithms, 50(1):79-95, 2004.
13. D. Dor, S. Halperin, and U. Zwick. All-pairs almost shortest paths. SIAM J. Computing, pages 1740-1759, 2000.
14. M.Elkin. Computing almost shortest paths. In PODC, pages 53-62, 2001.
15. M. Elkin and D. Peleg. (1 + ε, β)-spanner constructions for general graphs. In STOC, 2001.
16. P. Erdos. Extremal problems in graph theory. In Theory of Graphs and its Applications (Proc Sympos. Smolenice, 1963), page 2936, 1963.
17. F. Lazebnik, V Ustimenko, and A. Woldar. A characterization of the components of the graphs d(k, q). Discrete Mathematics, 157(1-3):271-283, 1996.
18. F. Lazebnik, V. Ustimenko, and A. J. Woldar. A new series of dense graphs of high girth. Bulletin of American Mathematical Society (New Series), 32(1):73-99, 1995.
19. D. Peleg and A. Schaffer. Graph spanners. Journal of Graph Theory, 13:99-116, 1989.
20. D. Peieg and J. Ullman. An optimal synchronizer for the hypercube. SIAM J. Computing, 18:740-747, 1989.
21. D. Peleg and E. Upfal. A trade-off between space and efficiency for routing tables. J. ACM, 36(3):510-530, 1989.
22. S. Pettie. Ultrasparse spanners with sublinear distortion. Manuscript, 2006.
23. L. Roddity, M. Thorup, and U. Zwick. Roundtrip spanners and roundtrip routing in directed graphs. In SODA, pages 844-851, 2002.
24. L. Roddity, M. Thorup, and U. Zwick. Deterministic constructions of approximate distances oracles and spanners. In ICALP, 2005.
25. M. Thorup and U. Zwick. Compact routing schemes. In SPAA, pages 1-10, 2001.
26. M. Thorup and U. Zwick. Approximate distance oracles. JACM, 52(1):1-24, 2005.
27. M. Thorup and U. Zwick. Spanners and emulators with sublinear distance errors. In SODA, 2006.
28. 10,s. Journal of Combinatorial Theory, pages 113-116, 1991.