Approximation Limits of Linear Programs (Beyond Hierarchies)

We develop a framework for proving approximation limits of polynomial size linear programs (LPs) from lower bounds on the nonnegative ranks of suitably defined matrices. This framework yields unconditional impossibility results that are applicable to any LP as opposed to only programs generated by hierarchies. Using our framework, we prove that O(n1/2-ϵ)-approximations for CLIQUE require LPs of size 2nΩ(ϵ). This lower bound applies to LPs using a certain encoding of CLIQUE as a linear optimization problem. Moreover, we establish a similar result for approximations of semidefinite programs by LPs. Our main technical ingredient is a quantitative improvement of Razborov’s [38] rectangle corruption lemma for the high error regime, which gives strong lower bounds on the nonnegative rank of shifts of the unique disjointness matrix.

[1]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

[2]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[3]  Moses Charikar,et al.  Local Global Tradeoffs in Metric Embeddings , 2010, SIAM J. Comput..

[4]  Daniel Bienstock,et al.  Approximate formulations for 0-1 knapsack sets , 2008, Oper. Res. Lett..

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

[6]  Sanjeev Arora,et al.  Computing a nonnegative matrix factorization -- provably , 2011, STOC '12.

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

[8]  Toniann Pitassi,et al.  The story of set disjointness , 2010, SIGA.

[9]  Prasad Raghavendra,et al.  Making the Long Code Shorter , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

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

[11]  Nicolas Gillis,et al.  On the Geometric Interpretation of the Nonnegative Rank , 2010, 1009.0880.

[12]  Ryan O'Donnell,et al.  Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? , 2007, SIAM J. Comput..

[13]  Arkadi Nemirovski,et al.  On Polyhedral Approximations of the Second-Order Cone , 2001, Math. Oper. Res..

[14]  Mark Braverman,et al.  An information complexity approach to extended formulations , 2013, STOC '13.

[15]  M. Yannakakis.  Expressing combinatorial optimization problems by linear programs , 1991, Symposium on the Theory of Computing.

[16]  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).

[17]  Sebastian Pokutta,et al.  Common Information and Unique Disjointness , 2013, FOCS.

[18]  Yuan Zhou,et al.  Hypercontractivity, sum-of-squares proofs, and their applications , 2012, STOC '12.

[19]  Claire Mathieu,et al.  Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack , 2011, IPCO.

[20]  Prasad Raghavendra,et al.  Approximate Constraint Satisfaction Requires Large LP Relaxations , 2013, FOCS.

[21]  Mohit Singh,et al.  Improving Integrality Gaps via Chvátal-Gomory Rounding , 2010, APPROX-RANDOM.

[22]  L. Wolsey.  Heuristic analysis, linear programming and branch and bound , 1980 .

[23]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[24]  Robert D. Carr,et al.  Compacting cuts: a new linear formulation for minimum cut , 2007, SODA '07.

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

[26]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

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

[28]  Ziv Bar-Yossef,et al.  An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[29]  Laurence A. Wolsey,et al.  Approximate extended formulations , 2006, Math. Program..

[30]  Subhash Khot.  On the power of unique 2-prover 1-round games , 2002, STOC '02.

[31]  Rekha R. Thomas,et al.  Lifts of Convex Sets and Cone Factorizations , 2011, Math. Oper. Res..

[32]  William J. Cook,et al.  On the Matrix-Cut Rank of Polyhedra , 2001, Math. Oper. Res..

[33]  Jean B. Lasserre,et al.  An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs , 2002, SIAM J. Optim..

[34]  David P. Williamson,et al.  New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem , 1994, SIAM J. Discret. Math..

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

[36]  Hans Raj Tiwary,et al.  Exponential Lower Bounds for Polytopes in Combinatorial Optimization , 2011, J. ACM.

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