New constructions of (α, β)-spanners and purely additive spanners

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 672-681

  Baswana, Surender ^a   Kavitha, Telikepalli ^a   Mehlhorn, Kurt ^a   Pettie, Seth ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY VALUE PROBLEMS; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

ADDITIVE SPANNERS; CONSTRUCTION ALGORITHMS; LINEAR TIME CONSTRUCTION; UNWEIGHTED GRAPH;

GRAPH THEORY;

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

References (25)

1. [ACIM99] D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput., 28(4):1167-1181, 1999.
2. [ADD+93] I. Althöfer, G. Das, D. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete and Computational Geometry, 9:81-100, 1993.
3. [BCE03] B. Bollobás, D. Coppersmith, and M. Elkin. Sparse distance preservers and additive spanners. In Proc. 14th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 414-423, 2003.
4. 2polylogn) time, manuscript, 2004.
5. 1+1/k) size in weighted graphs. In 30th Ann. Intl. Colloq. on Automata, Languages and Programming (ICALP), 2003.
6. 2 log n) time. In Proc. 15th Annual ACM-SIAM Symp. on Discrete Algorithms, 2004.
7. [Coh98] E. Cohen. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. Comput., 28:210-236, 1998.
8. [Coh00] E. Cohen. Polylog-time and near-linear work approximation scheme for undirected shortest-paths. J. ACM, 47:132-166, 2000.
9. [Cow01] L. J. Cowen. Compact routing with minimum stretch. J. Algor., 28:170-183, 2001.
10. [CW04] L. J. Cowen and C. G. Wagner. Compact roundtrip routing in directed networks. J. Algor., 50(1):79-95, 2004.
11. [CZ01] E. Cohen and U. Zwick. All-pairs small-stretch paths. J. Algor., 38:335-353, 2001.
12. [DHZ00] D. Dor, S. Halperin, and U. Zwick. All-pairs almost shortest paths. SIAM J. Comput., 29(5):1740-1759, 2000.
13. [Elk01] M. Elkin. Computing almost shortest paths. In 20th ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, pages 53-62, 2001.
14. [Elk04] M. Elkin. Private communication. 2004.
15. [EP01] M. Elkin and D. Peleg. (1 + ε, β)-Spanner constructions for general graphs. In ACM Symposium on Theory of Computing (STOC), 2001.
16. [Erd63] P. Erdös. Extremal problems in graph theory. In Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963), pages 29-36. Publ. House Czechoslovak Acad. Sci., Prague, 1963.
17. [EZ04] M. Elkin and J. Zhang. Efficient algorithms for constructing (1 + ε β)-spanners in the distributed and streaming models. In Proc. 23rd Ann. Symp. on Principles of Distributed Computing, pages 160-168, 2004.
18. [HZ96] S. Halperin and U. Zwick. Unpublished result. 1996.
19. [PS89] D. Peleg and A. A. Schaffer. Graph spanners. Journal of Graph Theory, 13:99-116, 1989.
20. [PU89a] D. Peleg and J. D. Ullman. An optimal synchronizer for the hypercube. SIAM J. Comput., 18:740-747, 1989.
21. [PU89b] D. Peleg and E. Upfal. A trade-off between space amd efficiency for routing tables. J. ACM, 36(3):510-530, 1989.
22. [RTZ02] L. Roditty, M. Thorup, and U. Zwick. Roundtrip spanners and roundtrip routing in directed graphs. In Proc. 13th Ann. ACM-SIAM Symp. On Discrete Algorithms, pages 844-851, 2002.
23. [TZ01a] M. Thorup and U. Zwick. Approximate distance oracles. In Proc. 33rd Ann. ACM Symp. on Theory of Computing, pages 183-192, 2001.
24. [TZ01b] M. Thorup and U. Zwick. Compact routing schemes. In Proc. 13th Ann. ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 1-10, 2001.
25. 10,s. J. Combin. Theory Ser. B, 52(1):113-116, 1991.