Inapproximability of Maximum Biclique Problems, Minimum k-Cut and Densest At-Least-k-Subgraph from the Small Set Expansion Hypothesis

The Small Set Expansion Hypothesis is a conjecture which roughly states that it is NP-hard to distinguish between a graph with a small subset of vertices whose (edge) expansion is almost zero and one in which all small subsets of vertices have expansion almost one. In this work, we prove conditional inapproximability results with essentially optimal ratios for the following graph problems based on this hypothesis: Maximum Edge Biclique, Maximum Balanced Biclique, Minimum k-Cut and Densest At-Least-k-Subgraph. Our hardness results for the two biclique problems are proved by combining a technique developed by Raghavendra, Steurer and Tulsiani to avoid locality of gadget reductions with a generalization of Bansal and Khot’s long code test whereas our results for Minimum k-Cut and Densest At-Least-k-Subgraph are shown via elementary reductions.

[1]  Aditya Bhaskara,et al.  Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph , 2011, SODA.

[2]  Shimon Kogan,et al.  Hardness of approximation of the Balanced Complete Bipartite Subgraph problem , 2004 .

[3]  Irit Dinur,et al.  Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover , 2016, Electron. Colloquium Comput. Complex..

[4]  Ludek Kucera,et al.  Expected Complexity of Graph Partitioning Problems , 1995, Discret. Appl. Math..

[5]  Subhash Khot,et al.  Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion , 2006, ICALP.

[6]  Rajiv Gandhi,et al.  Bicovering: Covering edges with two small subsets of vertices , 2016, Electron. Colloquium Comput. Complex..

[7]  Omri Weinstein,et al.  ETH Hardness for Densest-k-Subgraph with Perfect Completeness , 2015, SODA.

[8]  Piotr Berman,et al.  On the Complexity of Approximating the Independent Set Problem , 1989, Inf. Comput..

[9]  Reid Andersen Finding large and small dense subgraphs , 2007, ArXiv.

[10]  A. Blum ALGORITHMS FOR APPROXIMATE GRAPH COLORING , 1991 .

[11]  Pasin Manurangsi,et al.  Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph , 2016, STOC.

[12]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[13]  Ryan O'Donnell,et al.  Noise stability of functions with low influences: Invariance and optimality , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[14]  Andrew Chi-Chih Yao,et al.  Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem , 2009, Algorithmica.

[15]  Prasad Raghavendra,et al.  Graph expansion and the unique games conjecture , 2010, STOC '10.

[16]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[17]  Anupam Gupta,et al.  An FPT Algorithm Beating 2-Approximation for k-Cut , 2017, SODA.

[18]  Aravindan Vijayaraghavan,et al.  Approximation Algorithms for Label Cover and The Log-Density Threshold , 2017, SODA.

[19]  René Peeters,et al.  The maximum edge biclique problem is NP-complete , 2003, Discret. Appl. Math..

[20]  Dorit S. Hochbaum,et al.  A Polynomial Algorithm for the k-cut Problem for Fixed k , 1994, Math. Oper. Res..

[21]  Noga Alon,et al.  Derandomized graph products , 1995, computational complexity.

[22]  Pasin Manurangsi,et al.  On approximating projection games , 2015 .

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

[24]  Ola Svensson Hardness of Vertex Deletion and Project Scheduling , 2012, APPROX-RANDOM.

[25]  Vijay V. Vazirani,et al.  Finding k-cuts within twice the optimal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[26]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[27]  Dana Moshkovitz,et al.  The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover , 2012, Theory Comput..

[28]  Prasad Raghavendra,et al.  The Complexity of Approximating Vertex Expansion , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[29]  Jon M. Kleinberg,et al.  Segmentation problems , 2004, JACM.

[30]  Russell Impagliazzo,et al.  Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[31]  Mark Jerrum,et al.  Large Cliques Elude the Metropolis Process , 1992, Random Struct. Algorithms.

[32]  Guy Kindler,et al.  Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[33]  Subhash Khot,et al.  Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[34]  Guy Kortsarz,et al.  On Choosing a Dense Subgraph (Extended Abstract) , 1993, FOCS 1993.

[35]  Dorit S. Hochbaum,et al.  Polynomial algorithm for the k-cut problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[36]  Subhash Khot,et al.  Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[37]  Rajiv Gandhi,et al.  Bi-Covering: Covering Edges with Two Small Subsets of Vertices , 2016, SIAM J. Discret. Math..

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

[39]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[40]  Aditya Bhaskara,et al.  Detecting high log-densities: an O(n¼) approximation for densest k-subgraph , 2010, STOC '10.

[41]  Samir Khuller,et al.  On Finding Dense Subgraphs , 2009, ICALP.

[42]  Lars Engebretsen,et al.  Clique Is Hard To Approximate Within , 2000 .

[43]  Prasad Raghavendra,et al.  A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs , 2016, ICALP.

[44]  J. Håstad Clique is hard to approximate withinn1−ε , 1999 .

[45]  Prasad Raghavendra,et al.  Reductions between Expansion Problems , 2010, 2012 IEEE 27th Conference on Computational Complexity.

[46]  Kumar Chellapilla,et al.  Finding Dense Subgraphs with Size Bounds , 2009, WAW.

[47]  Sanjeev Arora,et al.  Inapproximabilty of Densest κ-Subgraph from Average Case Hardness , 2011 .

[48]  Ola Svensson,et al.  Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut , 2011, SIAM J. Comput..

[49]  Subhash Khot,et al.  Optimal Long Code Test with One Free Bit , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[50]  Refael Hassin,et al.  Complexity of finding dense subgraphs , 2002, Discret. Appl. Math..

[51]  Pasin Manurangsi,et al.  Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis , 2017, ICALP.

[52]  Vijay V. Vazirani,et al.  Finding k Cuts within Twice the Optimal , 1995, SIAM J. Comput..

[53]  Yuval Rabani,et al.  Tree packing and approximating k-cuts , 2001, SODA '01.

[54]  U. Feige,et al.  On the Densest K-subgraph Problem , 1997 .

[55]  Subhash Khot,et al.  On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[56]  Anand Srivastav,et al.  Finding Dense Subgraphs with Semidefinite Programming , 1998, APPROX.

[57]  David Steurer,et al.  Analytical approach to parallel repetition , 2013, STOC.

[58]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

[59]  Toshihide Ibaraki,et al.  Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts , 1999, J. Comb. Optim..

[60]  R. Ravi,et al.  Approximating k-cuts via network strength , 2002, SODA '02.

[61]  T. Sanders Analysis of Boolean Functions , 2012, ArXiv.

[62]  Uriel Feige,et al.  Relations between average case complexity and approximation complexity , 2002, STOC '02.

[63]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[64]  Michael Langberg,et al.  Approximation Algorithms for Maximization Problems Arising in Graph Partitioning , 2001, J. Algorithms.