Approximating k-spanner problems for k>2

Theoretical Computer Science

Volumn 337, Issue 1-3, 2005, Pages 249-277

  Elkin, Michael ^a   Peleg, David ^b  

^a Yale University   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Approximation algorithms; Graph algorithms; Spanners

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS; EUCLIDEAN GRAPHS; GRAPH ALGORITHMS; SPANNERS;

COMPUTER SCIENCE;

EID: 18444410256     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.11.022     Document Type: Article

References (25)

1. I. Althöfer, G. Das, D. Dobkin, D. Joseph, Generating sparse spanners for weighted graphs, in: Proc. 2nd Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 447, Springer, Berlin, New York, 1990, pp. 26-37.
2. B. Awerbuch, A. Baratz, D. Peleg, Efficient broadcast and light-weight spanners, Unpublished manuscript, November 1991.
3. B. Bollobas Extremal Graph Theory 1978 Academic Press New York
4. L. Cai NP-completeness of minimum spanner problems Discrete Appl. Math. 48 1994 187 194
5. L. Cai, and D.G. Corneil Tree spanners SIAM J. Discrete Math. 8 1995 359 387
6. B. Chandra, G. Das, G. Narasimhan, J. Soares, New sparseness results on graph spanners, in: Proc. 8th ACM Symp. on Computational Geometry, 1992, pp. 192-201.
7. L.P. Chew, There is a planar graph almost as good as the complete graph, in: Proc. ACM Symp. on Computational Geometry, 1986, pp. 169-177.
8. D.P. Dobkin, S.J. Friedman, K.J. Supowit, Delaunay graphs are almost as good as complete graphs, in: Proc. 31st IEEE Symp. on Foundations of Computer Science, 1987, pp. 20-26.
9. D. Dor, S. Halperin, U. Zwick, All pairs almost shortest paths, in: Proc. 37th IEEE Symp. on Foundations of Computer Science, 1997, pp. 452-461.
10. M.-L. Elkin, Additive spanners and diameter problem, Manuscript, 2000.
11. M.-L. Elkin, and D. Peleg The hardness of approximating spanner problems Proc. 17th Symp. on Theoretical Aspects of Computer Science February 2000 Lille France 370 381
12. M.-L. Elkin, D. Peleg, Strong inapproximability of the basic k-spanner problem, in: Proc. 27th Internat. Coll. on Automata, Languages and Programming, Geneva, Switzerland, July 2000
13. see also Techn. Report MCS99-23, the Weizmann Institute of Science, 1999.
14. M.-L. Elkin, D. Peleg, The client-server 2-spanner problem and applications to network design, Tech. Report MCS99-24, the Weizmann Institute of Science, 1999.
15. M.-L. Elkin, D. Peleg, (1 + ε, β) -Spanners constructions for general graphs, in: Proc. 33rd Ann. ACM Symp. on Theory of Computing, Crete, Greece, July, 2001, pp. 173-182.
16. S.P. Fekete, J. Kremer, Tree spanners in planar graphs, Report No. 97.296, Angewandte Mathematik und Informatik Universitat zu Koln.
17. S. Halperin, U. Zwick, Private communication, 1996.
18. G. Kortsarz, On the hardness of approximating spanners, in: Proc. 1st Internat. Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Lecture Notes in Computer Science, Vol. 1444, Springer, Berlin, New York, 1998, pp. 135-146.
19. G. Kortsarz, and D. Peleg Generating Sparse 2-Spanners J. Algorithms 17 1994 222 236
20. E.L. Lawler Combinatorial Optimization Networks and Matroids 1976 Holt, Rinehart Winston, New York
21. D. Peleg Distributed Computing A Locality-Sensitive Approach 2000 SIAM Philadelphia, PA
22. D. Peleg, and E. Reshef A variant of the arrow distributed directory with low average complexity Proc. 26th Internat. Coll. on Automata, Languages & Prog. July 1999 Prague Czech Republic 615 624
23. D. Peleg, and A. Schäffer Graph spanners J. Graph Theory 13 1989 99 116
24. D. Peleg, and J.D. Ullman An optimal synchronizer for the hypercube SIAM J. Comput. 18 1989 740 747
25. E. Scheinerman The maximal integer number of graphs with given genus J. Graph Theory 11 3 1987 441 446