Lowest Degree k-Spanner: Approximation and Hardness

A k-spanner is a subgraph in which distances are approximately preserved, up to some given stretch factor k. We focus on the following problem: Given a graph and a value k, can we find a k-spanner that minimizes the maximum degree? While reasonably strong bounds are known for some spanner problems, they almost all involve minimizing the total number of edges. Switching the objective to the degree introduces significant new challenges, and currently the only known approximation bound is an O~(Delta^(3-2*sqrt(2)))-approximation for the special case when k = 2 [Chlamtac, Dinitz, Krauthgamer FOCS 2012] (where Delta is the maximum degree in the input graph). In this paper we give the first non-trivial algorithm and polynomial-factor hardness of approximation for the case of general k. Specifically, we give an LP-based O~(Delta^((1-1/k)^2) )-approximation and prove that it is hard to approximate the optimum to within Delta^Omega(1/k) when the graph is undirected, and to within Delta^Omega(1) when it is directed.

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

[2]  Kyomin Jung,et al.  Transitive-Closure Spanners of the Hypercube and the Hypergrid , 2009, Electron. Colloquium Comput. Complex..

[3]  Shiri Chechik,et al.  New Additive Spanners , 2013, SODA.

[4]  David P. Dobkin,et al.  On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..

[5]  Ran Raz,et al.  Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner , 2012, ICALP.

[6]  David Peleg,et al.  The Hardness of Approximating Spanner Problems , 2000, STACS.

[7]  David Peleg,et al.  Approximating k-Spanner Problems for k>2 , 2001, IPCO.

[8]  Michael Langberg,et al.  Fault-tolerant spanners for general graphs , 2009, STOC '09.

[9]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[10]  Mohit Singh,et al.  Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal , 2015, J. ACM.

[11]  Kurt Mehlhorn,et al.  Additive spanners and (α, β)-spanners , 2010, TALG.

[12]  Michael Dinitz,et al.  Spanners with Slack , 2006, ESA.

[13]  Andrea Montanari,et al.  Generating random graphs with large girth , 2008, SODA.

[14]  Guy Kortsarz.  On the Hardness of Approximating Spanners , 2001, Algorithmica.

[15]  David Peleg,et al.  Strong Inapproximability of the Basic k-Spanner Problem , 2000, ICALP.

[16]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[17]  Michael Dinitz,et al.  Lowest-Degree k-Spanner: Approximation and Hardness , 2016, Theory of Computing.

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

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

[20]  Michael Dinitz,et al.  Everywhere-Sparse Spanners via Dense Subgraphs , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[21]  Michael Langberg,et al.  Fault Tolerant Spanners for General Graphs , 2010, SIAM J. Comput..

[22]  Michael Dinitz,et al.  Fault-tolerant spanners: better and simpler , 2011, PODC '11.

[23]  Michael Elkin,et al.  Fast Constructions of Lightweight Spanners for General Graphs , 2012, ACM Trans. Algorithms.

[24]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[25]  Yael Tauman Kalai,et al.  A Parallel Repetition Theorem for Leakage Resilience , 2012, TCC.

[26]  Michael Dinitz,et al.  Directed spanners via flow-based linear programs , 2011, STOC '11.

[27]  Shiri Chechik,et al.  Compact Routing Schemes , 2016, Encyclopedia of Algorithms.

[28]  Arnab Bhattacharyya,et al.  Improved Approximation for the Directed Spanner Problem , 2011, ICALP.

[29]  DistanceYevgeniy Dodis,et al.  Designing Networks with Bounded Pairwise Distance , 1999 .