Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph

The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant gap between known upper and lower bounds for Densest k-subgraph: the current best algorithm gives an a O(n1/4) approximation, while even showing a small constant factor hardness requires significantly stronger assumptions than P ≠ NP. In addition to interest in designing better algorithms, a number of recent results have exploited the conjectured hardness of Densest k-subgraph and its variants. Thus, understanding the approximability of Densest k-subgraph is an important challenge. In this work, we give evidence for the hardness of approximating Densest k-subgraph within polynomial factors. Specifically, we expose the limitations of strong semidefinite programs from SDP hierarchies in solving Densest k-subgraph. Our results include: • A lower bound of Ω(n1/4/log3 n) on the integrality gap for Ω(log n/log log n) rounds of the Sherali-Adams relaxation for Densest k-subgraph. This also holds for the relaxation obtained from Sherali-Adams with an added SDP constraint. Our gap instances are in fact Erdos-Renyi random graphs. • For every e > 0, a lower bound of n2/53−e on the integrality gap of nΩ(e) rounds of the Lasserre SDP relaxation for Densest k-subgraph, and an nΩe(1) gap for n1−e rounds. Our construction proceeds via a reduction from random instances of a certain Max-CSP over large domains. In the absence of inapproximability results for Densest k-subgraph, our results show that beating a factor of nΩ(1) is a barrier for even the most powerful SDPs, and in fact even beating the best known n1/4 factor is a barrier for current techniques. Our results indicate that approximating Densest k-subgraph within a polynomial factor might be a harder problem than Unique Games or Small Set Expansion, since these problems were recently shown to be solvable using neΩ(1) rounds of the Lasserre hierarchy, where e is the completeness parameter in Unique Games and Small Set Expansion.

[1]  Toniann Pitassi,et al.  Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[2]  Santosh S. Vempala,et al.  Local versus global properties of metric spaces , 2006, SODA '06.

[3]  Prasad Raghavendra,et al.  Rounding Semidefinite Programming Hierarchies via Global Correlation , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[4]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

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

[6]  Prasad Raghavendra,et al.  Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[7]  Luca Trevisan,et al.  Gowers Uniformity, Influence of Variables, and PCPs , 2009, SIAM J. Comput..

[8]  Subhash Khot.  Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique , 2004, FOCS.

[9]  Venkatesan Guruswami,et al.  Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems , 2014, SIAM J. Optim..

[10]  U. Feige,et al.  On the densest k-subgraph problems , 1997 .

[11]  Madhur Tulsiani,et al.  A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[12]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[13]  Madhur Tulsiani.  CSP gaps and reductions in the lasserre hierarchy , 2009, STOC '09.

[14]  Madhur Tulsiani,et al.  Optimal Sherali-Adams Gaps from Pairwise Independence , 2009, APPROX-RANDOM.

[15]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[16]  Venkatesan Guruswami,et al.  Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

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

[18]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[19]  Avi Wigderson,et al.  Public-key cryptography from different assumptions , 2010, STOC '10.

[20]  Wenceslas Fernandez de la Vega,et al.  Linear programming relaxations of maxcut , 2007, SODA '07.

[21]  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.

[22]  Béla Bollobás,et al.  Proving Integrality Gaps without Knowing the Linear Program , 2006, Theory Comput..

[23]  Madhur Tulsiani,et al.  Convex Relaxations and Integrality Gaps , 2012 .

[24]  Rishi Saket,et al.  SDP Integrality Gaps with Local̀ 1-Embeddability Subhash Khot , 2009 .

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

[26]  Sanjeev Arora,et al.  Computational complexity and information asymmetry in financial products , 2011, Commun. ACM.

[27]  Luca Trevisan,et al.  Gowers uniformity, influence of variables, and PCPs , 2005, STOC '06.

[28]  Subhash Khot,et al.  SDP Integrality Gaps with Local ell_1-Embeddability , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[29]  Grant Schoenebeck,et al.  Linear Level Lasserre Lower Bounds for Certain k-CSPs , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

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

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

[32]  D. Eskandani.  Semidefinite and Second Order Cone Programming Seminar Fall 2012 A Comparison of the Sherali-Adams , Lovàsz-Schrijver and Lasserre Relaxations for 0-1 Programming , 2012 .

[33]  Moses Charikar,et al.  Local Global Tradeoffs in Metric Embeddings , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[34]  Madhur Tulsiani,et al.  Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut , 2007, STOC '07.

[35]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[36]  Gyanit Singh,et al.  Improved Approximation Guarantees through Higher Levels of SDP Hierarchies , 2008, APPROX-RANDOM.

[37]  Luca Trevisan,et al.  A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.

[38]  Eden Chlamtác,et al.  Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[39]  Venkatesan Guruswami,et al.  Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives , 2011, Electron. Colloquium Comput. Complex..

[40]  Monique Laurent,et al.  A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming , 2003, Math. Oper. Res..

[41]  T. Pitassi,et al.  Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy , 2007, FOCS 2007.

[42]  Moses Charikar,et al.  Integrality gaps for Sherali-Adams relaxations , 2009, STOC '09.

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