Strong inapproximability of the basic k-spanner problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1853, Issue , 2000, Pages 636-648

  Elkin, Michael ^a   Peleg, David ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; HARDNESS; ROBOTS;

APPROXIMABILITY; APPROXIMATION RATIOS; AUGMENTATION PROBLEMS; HARDNESS RESULT; INAPPROXIMABILITY; LOWER BOUNDS; NEGATIVE SIDES; UPPER AND LOWER BOUNDS;

APPROXIMATION ALGORITHMS;

EID: 84974593483     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_54     Document Type: Conference Paper

References (16)

1. I. Althöfer, G. Das, D. Dobkin, D. Joseph and J. Soares, On Sparse Spanners of Weighted Graphs, Discrete & Computational Geometry, 9, (1993), pp. 81-100
2. Baruch Awerbuch, Alan Baratz, and David Peleg. Efficient broadcast and lightweight spanners. Technical Report CS92-22, Weizmann Institute, October 1992.
3. B. Bollobas, Extremal Graph Theory. Academic Press, 1978.
4. Robert Carr, Srinivas Doddi, Goran Konjevod, and Madhav Marathe. On the redblue set cover problem. In Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, 2000.
5. B. Chandra, G. Das, G. Narasimhan and J. Soares, New Sparseness Results on Graph Spanners, Proc 8th ACM Symp. on Computat. Geometry, 192-201, 1992.
6. I. Dinur and S. Safra, On the hardness of Approximating Label Cover, Electronic Colloquium on Computational Complexity, Report No. 15 (1999)
7. Y. Dodis and S. Khanna, Designing Networks with Bounded Pairwise Distance, Proc. 30th ACM Ann. Symp. of Theory of Computing, 1999.
8. M.-L. Elkin and D. Peleg, The Hardness of Approximating Spanner Problems, Proc. 17th Symp. on Theoretical Aspects of Computer Science, Lille, France, 2000.
9. M.-L. Elkin and D. Peleg, The Client-Server 2-Spanner Problem and Applications to Network Design, Technical Report MCS99-24, the Weizmann Institute, 1999.
10. D. Hochbaum Approximation Algorithms for NP-hard Problems, PWS Publishing Company, Boston, 1997.
11. G. Kortsarz, On the Hardness of Approximating Spanners, Proc. APPROX., LNCS, Vol. 1444, pp. 135-146, Springer-Verlag, New York/Berlin, 1998.
12. G. Kortsarz and D. Peleg, Generating Sparse 2-Spanners. J. Algorithms, 17 (1994) 222-236.
13. D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM, Philadelphia, PA, 2000, in press.
14. D. Peleg and A. Schäffer, Graph Spanners, J. Graph Theory 13 (1989), 99-116.
15. C. Papadimitriou and M. Yannakakis. Optimization, Approximation and Complexity Classes, J. of Computer and System Sciences, 43, 1991, pp. 425-440.
16. R. Raz, A parallel repetition theorem. Proc. 27th ACM STOC pp.447-456, 1995