On the hardness of approximating spanners

Algorithmica (New York)

Volumn 30, Issue 3, 2001, Pages 432-450

  Kortsarz, G ^a  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

Graph spanners; Hardness of approximation

Indexed keywords

GRAPH THEORY; ROBOTICS; TELECOMMUNICATION NETWORKS; TOPOLOGY;

GRAPH SPANNERS;

COMPUTER SCIENCE;

EID: 0242269933     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0021-y     Document Type: Article

References (32)

1. B. Awerbuch, A. Baratz, and D. Peleg, Efficient Broadcast and Light-Weight Spanners, Technical Report CS92-22, The Weizmann Institute of Science, Rehovot, 1992.
2. I. Althöfer, G. Das, D. Dobkin, and D. Joseph, Generating sparse spanners for weighted graphs, Discrete Comput. Geom., 9 (1993), 81-100
3. S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid, Euclidean spanners: short, thin, and lanky, Proc. 27th ACM Symp. on Theory of Computing, 1995, pp. 489-498.
4. B. Bollobás, Combinatorics, Cambridge University Press, Cambridge, 1986.
5. U. Brandes and D. Handke, NP-completeness results for minimum planar spanners, Proc. 23rd Workshop on Graph-Theoretic Concepts in Computer Science (WG97), Lecture Notes in Computer Science 1335, Springer-Verlag, Berlin, 1997, pp. 85-99.
6. H. Chernoff, A measure of asymptotic efficiency for tests of hypothesis based on the sum of observations, Ann. Math. Statist., 23 (1952), 493-507.
7. L. P. Chew, There is a planar graph almost as good as the complete graph, J. Comput. System Sci., (1989), 205-219.
8. L. Cai, NP-completeness of minimum spanner problems, Discrete Appl. Math., 9 (1993), 81-100.
9. B. Chandra, G. Das, G. Narasimhan, and J. Soares, New sparseness results for graph spanners, Internat. J. Comput. Geom. Appl., 5 (1995), 125-144.
10. L. Cai and M. Keil, Spanners in graphs of bounded degree, Networks, 24 (1994), 187-194.
11. D. P. Dobkin, S. J. Friedman, and K. J. Supowit, Delaunay graphs are almost as good as complete graphs, Discrete Comput. Geom., 5 (1990), 399-407.
12. G. Das and D. Joseph, Which triangulation approximates the complete graph?, Proc. Internat. Symp. on Optimal Algorithms, 1989, pp. 168-192.
13. U. Feige, A threshold of Inn for approximating set cover, Proc. 28th ACM Symp. on Theory of Computing, 1996, pp. 314-318.
14. U. Feige and L. Lovász, Two-prover one-round proof systems: their power and their problems, Proc. 24th ACM Symp. on Theory of Computing, 1992, pp. 733-741.
15. G. Gallo, M. D. Grigoriadis, and R. E. Tarjan, A fast parametric maximum flow algorithm and applications, SIAM J. Comput., 18 (1989), 30-55.
16. D. S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9 (1974), 256-278.
17. G. Kortsarz and D. Peleg, Generating sparse 2-spanners, J. Algorithms, 17 (1994), 222-236.
18. L. Lovász, On the ratio of integral and fractional covers, Discrete Math., 13 (1975), 383-390.
19. C. Levcopoulos and A. Lingas, There is a planar graph almost as good as the complete graph and as short as minimum spanning trees, Algorithmica, 8 (1992), 251-256.
20. A. L. Liestman and T. C. Shermer, Grid spanners, Networks, 23 (1993), 123-133.
21. A. L. Liestman and T. C. Shermer, Additive graph spanners, Nefworks, 23 (1993), 343-364.
22. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Proc 25th ACM Symp. on Theory of Computing, 1993, pp. 286-293.
23. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, 1995.
24. D. Peleg and A. Schäffer, Graph spanners, J. Graph Theory, 13 (1989), 99-116.
25. D. Peleg and E. Upfal, A tradeoff between space and efficiency for routing tables, J. Assoc. Comput. Mach., 1989, 510-530.
26. D. Peleg and J. D. Ullman, An Optimal Synchronizer for the Hypercube, SIAM J. Comput., 18 (1989), 740-747.
27. R. Raz, A parallel repetition theorem, Proc. 27th ACM Symp. on the Theory of Computing, 1995, pp. 447-456.
28. D. Richards and A. L. Liestman, Degree-constraint pyramid spanners, J. Parallel Distrib. Comput., 25 (1995), 740-747.
29. R. Raz and S. Safra, A subconstant error probability low degree test, and a subconstant error probability PCP characterization of NP, Proc. 29th ACM Symp. on Theory of Computing, 1997, pp. 475-484.
30. J. Spencer, Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, PA, 1987.
31. J. Soares, Approximating Euclidean distances by small degree graphs, No. 92-05, University of Chicago, 1992.
32. G. Venkatesan, U. Rotics, M. S. Madanlal, J. A. Makowsy, and C. Pandu Rangan, Restrictions of Minimum Spanner Problems, 1997, Manuscript.