A Note on Degree vs Gap of Min-Rep Label Cover and Improved Inapproximability for Connectivity Problems

This note concerns the trade-off between the degree of the constraint graph and the gap in hardness of approximating the Min-Rep variant of Label Cover (aka Projection Game). We make a very simple observation that, for NP-hardness with gap $g$, the degree can be made as small as $O(g \log g)$, which improves upon the previous $\tilde{O}(g^{1/2})$ bound from a work of Laekhanukit (SODA'14). Note that our bound is optimal up to a logarithmic factor since there is a trivial $\Delta$-approximation for Min-Rep where $\Delta$ is the maximum degree of the constraint graph. Thanks to known reductions, this improvement implies better hardness of approximation results for Rooted $k$-Connectivity, Vertex-Connectivity Survivable Network Design and Vertex-Connectivity $k$-Route Cut.

[1]  Pasin Manurangsi,et al.  ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network , 2018, ITCS.

[2]  Zeev Nutov.  Approximating minimum-cost connectivity problems via uncrossable bifamilies , 2012, TALG.

[3]  Chandra Chekuri,et al.  A Graph Reduction Step Preserving Element-Connectivity and Packing Steiner Trees and Forests , 2014, SIAM J. Discret. Math..

[4]  Guy Kindler,et al.  Approximation of non-boolean 2CSP , 2016, SODA.

[5]  Dana Moshkovitz.  The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover , 2015, Theory Comput..

[6]  Sanjeev Khanna,et al.  Algorithms for Single-Source Vertex Connectivity , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[7]  Sanjeev Khanna,et al.  An O(k3log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design , 2012, Theory of Computing.

[8]  Chandra Chekuri,et al.  Single-Sink Network Design with Vertex Connectivity Requirements , 2008, FSTTCS.

[9]  Bundit Laekhanukit.  Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems , 2014, SODA.

[10]  Siu On Chan,et al.  Approximation resistance from pairwise independent subgroups , 2013, STOC '13.

[11]  Yuan Zhou,et al.  Approximation Algorithms and Hardness of the k-Route Cut Problem , 2011, TALG.

[12]  Adrian Vetta,et al.  Approximating Rooted Steiner Networks , 2012, SODA.

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

[14]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[15]  Subhash Khot,et al.  A Two Prover One Round Game with Strong Soundness , 2011, FOCS.

[16]  Subhash Khot,et al.  Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs , 2009, Computational Complexity Conference.

[17]  Sanjeev Khanna,et al.  Network design for vertex connectivity , 2008, STOC.

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

[19]  Zeev Nutov,et al.  A note on Rooted Survivable Networks , 2009, Inf. Process. Lett..