On the Hardness of Approximating Spanners

Abstract. A k -spanner of a connected graph G=(V,E) is a subgraph G' consisting of all the vertices of V and a subset of the edges, with the additional property that the distance between any two vertices in G' is larger than the distance in G by no more than a factor of k . This paper concerns the hardness of finding spanners with a number of edges close to the optimum. It is proved that for every fixed k , approximating the spanner problem is at least as hard as approximating the set-cover problem. We also consider a weighted version of the spanner problem, and prove an essential difference between the approximability of the case k=2 and the case k\geq 5 .

[1]  J. Spencer.  Ten lectures on the probabilistic method , 1987 .

[2]  Paul Chew,et al.  There are Planar Graphs Almost as Good as the Complete Graph , 1989, J. Comput. Syst. Sci..

[3]  C. Pandu Rangan,et al.  Restrictions of Minimum Spanner Problems , 1997, Inf. Comput..

[4]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[5]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[6]  Dagmar Handke,et al.  NP-Completeness Results for Minimum Planar Spanners , 1998, Discret. Math. Theor. Comput. Sci..

[7]  David P. Dobkin,et al.  Generating Sparse Spanners for Weighted Graphs , 1990, SWAT.

[8]  Arthur L. Liestman,et al.  Additive graph spanners , 1993, Networks.

[9]  Eli Upfal,et al.  A trade-off between space and efficiency for routing tables , 1989, JACM.

[10]  David P. Dobkin,et al.  Delaunay graphs are almost as good as complete graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[11]  Robert E. Tarjan,et al.  A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..

[12]  José Soares,et al.  Approximating Euclidean distances by small degree graphs , 1994, Discret. Comput. Geom..

[13]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[14]  David Peleg,et al.  An optimal synchronizer for the hypercube , 1987, PODC '87.

[15]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[16]  Giri Narasimhan,et al.  New sparseness results on graph spanners , 1992, SCG '92.

[17]  Jose Augusto Ramos Soares,et al.  Graph Spanners: a Survey , 1992 .

[18]  Ulrik BrandesandDagmarHandke.  – Completeness Results for Minimum Planar Spanners , 1998 .

[19]  Paul Chew,et al.  There is a planar graph almost as good as the complete graph , 1986, SCG '86.

[20]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[21]  Leizhen Cai,et al.  NP-Completeness of Minimum Spanner Problems , 1994, Discret. Appl. Math..

[22]  Michiel H. M. Smid,et al.  Euclidean spanners: short, thin, and lanky , 1995, STOC '95.

[23]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[24]  Guy Kortsarz,et al.  Generating Sparse 2-Spanners , 1992, J. Algorithms.

[25]  László Lovász,et al.  Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.

[26]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[27]  Leizhen Cai,et al.  Spanners in graphs of bounded degree , 1994, Networks.