The hardness of approximating spanner problems

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

Volumn 1770, Issue , 2000, Pages 370-381

  Elkin, Michael ^a   Peleg, David ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

HARDNESS;

APPROXIMABILITY; APPROXIMATION RATIOS; CLIENT SERVER; EDGE WEIGHTS; HARDNESS RESULT; INAPPROXIMABILITY; NP-HARD; RATIO DEGRADATION;

INVERSE PROBLEMS;

EID: 84944071481     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46541-3_31     Document Type: Conference Paper

References (26)

1. I. Althöfer, G. Das, D. Dobkin and D. Joseph, Generating sparse spanners for weighted graphs, Proc. 2nd Scandinavian Workshop on Algorithm Theory, Lect. Notes in Comput. Sci., Vol. 447, pp. 26-37, Springer-Verlag, New York/Berlin, 1990.
2. Baruch Awerbuch, Alan Baratz, and David Peleg. Effcient broadcast and lightweight spanners. Unpublished manuscript, November 1991.
3. B. Bollobas, Extremal Graph Theory. Academic Press, 1978.
4. L. Cai, Tree-2-Spanners, Technical Report 91-4, Simon Fraser University,1991.
5. R. D. Carr, S. Doddi, G. Konjevod, M. V. Marathe On the Red-Blue Set Cover Problem, Los Alamos National Laboratory.
6. P. Chanas, Dimensionnement de réseaux ATM, PhD thesis, CNET Sophia, Sept. 1998.
7. B. Chandra, G. Das, G. Narasimhan and J. Soares, New Sparseness Results on Graph Spanners, Proc 8th ACM Symposium on Computational Geometry, pages 192-201, 1992.
8. L.P. Chew, There is a planar graph almost as good as the complete graph, Proc. ACM Symp. on Computational Geometry, 1986, pp. 169-177
9. G. Das and D. Joseph, Which triangulation approximates the complete graphs, Proc. Int. Symp. on Optimal Algorithms, Lect. Notes in Comput. Sci., Vol. 401, pp. 168-192, Springer-Verlag, New York/Berlin, 1989
10. I. Dinur and S. Safra, On the hardness of Approximating Label Cover, Electronic Colloquium on Computational Complexity, Report No. 15 (1999)
11. D.P. Dobkin, S.J. Friedman and K.J. Supowit, Delaunay graphs are almost as good as complete graphs, Proc. 31st IEEE Symp. on Foundations of Computer Science, 1987, pp. 20-26.
12. Y. Dodis and S. Khanna, Designing Networks with Bounded Pairwise Distance, Proc. 30th ACM Ann. Symp. of Theory of Computing, 1999.
13. M.-L. Elkin and D. Peleg, The Hardness of Approximating Spanner Problems, Technical Report MCS99-14, the Weizmann Institute of Science, 1999.
14. M.-L. Elkin and D. Peleg, The Client-Server 2-Spanner Problem and Applications to Network Design, Technical Report MCS99-24, the Weizmann Institute of Science, 1999.
15. M.-L. Elkin and D. Peleg, Classification of Spanner Problems, in preparation.
16. M.-L. Elkin and D. Peleg, Strong Inapproximability of the Basic k-Spanner Problem, Technical Report MCS99-23, the Weizmann Institute of Science, 1999.
17. U. Feige and L. Lovasz, Two prover one-round proof systems: Their power and their problems, Proc. 24th ACM Symp. on Theory of Computing, 733-741, 1992
18. D. Hochbaum Approximation Algorithms for NP-hard Problems, PWS Publishing Company, Boston, 1997.
19. G. Kortsarz, On the Hardness of Approximating Spanners, Proc. APPROX., Lect. Notes in Comput. Sci., Vol. 1444, pp. 135-146, Springer-Verlag, New York/Berlin, 1998.
20. G. Kortsarz and D. Peleg, Generating Sparse 2-Spanners. J. Algorithms, 17 (1994) 222-236.
21. C. Levcopoulos and A. Lingas, There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees, Proc. Int. Symp. on Optimal Algorithms, Lect. Notes in Comput. Sci., Vol. 401, pp. 9-13, Springer- Verlag, New York/Berlin, 1989
22. A.L. Liestman and T. Shermer, Grid Spanners, Networks 23 (1993),123-133.
23. D. Peleg, Locality-Sensitive Distributed Computing, unpublished manuscript, 1999.
24. D. Peleg and A. Schäffer, Graph Spanners, J. Graph Theory 13 (1989), 99-116.
25. D. Peleg and J.D. Ullman, An optimal synchronizer for the hypercube, SIAM J. Computing 18 (1989), pp. 740-747.
26. H. Regev, The weight of the Greedy Graph Spanner, Technical Report CS95-22, July 1995.