On the hardness of approximating spanners

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

Volumn 1444, Issue , 1998, Pages 135-146

  Kortsarz, Guy ^a  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; HARDNESS; OPTIMIZATION;

CONNECTED GRAPH; SET COVER PROBLEM; SUBGRAPHS;

GRAPH THEORY;

EID: 84958968556     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0053970     Document Type: Conference Paper

References (27)

1. I. Althöfer and G. Das and D. Dobkin and D. Joseph, Generating sparse spanners for weighted graphs, Discrete Compu. Geometry, 9, 1993, 81-100
2. B. Bollobás, Combinatorics, Cambridge University Press, 1986
3. H. Chernoff, A Measure of Asymptotic Efficiency for Tests of Hypothesis Based on the Sum of Observations, Ann. Math. Star., 23, 1952, 493-507
4. L.P. Chew, There is a Planar Graph Almost as Good as the Complete graph, ACM Syrup. on Computational Geometry, 1994, 169-177
5. L. Cai, NP-completeness of minimum spanner problems, Discrete Applied Math, 9, 1993, 81-100
6. B. Chandra and G. Das and G. Narasimhan and J. Soares, New sparseness results for graph spanners, Proc 8th ACM Symposium on Comp. Geometry, 1992
7. L. Cal and M. Keil, Spanners in graphs of bounded degree, Networks, 24, 1994, 187-194
8. D.P. Dobkin and S.J. Friedman and K.J. Supowit, Delannay Graphs are Almost as Good as Complete Graphs, Proc. 31st IEEE Syrup. on Foundations of Computer Science, 1987, 20-26
9. G. Das and D. Joseph, Which Triangulation Approximates the Complete Graph?, Int. Syrup. on Optimal Algorithms, 1989, 168-192
10. U. Feige, A threshold of Inn for approximating set cover, Proc. 28th ACM Symp. on Theory of Computing, 1996, 314-318
11. U. Feige, L. Lovász, Two-provers one-round proof systems: Their power and their problems, Proc. 24th ACM Syrup. on Theory of Computing, 733-741, 1992
12. G. Gallo and M.D. Grigoriadis and R.E. Tarjan, A fast Parametric maximum flow algorithm and applications, SIAM J. on Comput, 18, 1989, 30-55
13. D.S Johnson, Approximation Algorithms for Combinatorial Problems, J. of computer and system sciences, 9, 1974, 256-278
14. G. Kortsarz and D. Peleg, Generating Sparse 2-spanners, J. Algorithms, 17, 1994, 222-236
15. L. Lovász, On the ratio of Integral and Fractional Covers, Discrete Mathematics, 13, 1975, 383-390
16. C. Levcopoulos and A. Lingas, There is a Planar Graph Almost as Good as the Complete graph and as short as minimum spanning trees, International Symposium on Optimal Algorithms, LNCS-401, 1989, 9-13
17. A.L. Liestman and D. Richards, Degree-Constraint Pyramid Spanners, J. of Parallel and Distributed Computing, 1994
18. A.L. Liestman and T.C. Shermer, Grid Spanners, Networks, 23, 123-133, 1993
19. A. L. Liestman and T. C. Shermer, Additive graph Spanners, Networks, 23, 1993, 343-364
20. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Proc 25’th STOC, 1993, 286-293
21. D. Peleg and A. Schäffer, Graph Spanners, J. of Graph Theory, 13, 1989, 99-116
22. D. Peleg and E. Upfal, A Tradeoff between space and efficiency for routing tables, Journal of the ACM, 1989, 510-530
23. D. Peleg and J.D. Ullman, An optimal Synchronizer for the Hypercube, Siam J. on Comput., 18, 1989, 740-747
24. R. Raz, A parallel repetition theorem, Proc 27th ACM STOC, 1995, 447-456
25. J. Soares, Approximating Euclidean distances by small degree graphs, University of Chicago, No. 92-05, 1992
26. R. Raz and S. Safra, A sub constant error probability low degree test, and a sub constant error probability PCP characterization of NP, STOC, 1997, 475-484.
27. G. Venkatesan and U. Rotics and M.S. Madanlal and J.A. Makowsy and C. Pandu Rangan, Restrictions of Minimum Spanner Problems, 1997, Manuscript