Approximate constraint satisfaction requires large LP relaxations

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2013, Pages 350-359

  Chan, Siu On ^a   Lee, James R ^b   Raghavendra, Prasad ^c   Steurer, David ^d  

^a MSR New England ^*  (United Kingdom)

^b UNIVERSITY OF WASHINGTON   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d Department of Obstetrics Gynecology   (United States)

Author keywords

Approximation complexity; Constraint satisfaction problems; Extended formulations; Linear programming; Lower bounds; LP hierarchies

Indexed keywords

APPROXIMATION COMPLEXITY; CONSTRAINT SATISFACTION; EXTENDED FORMULATIONS; INTEGRALITY GAPS; LINEAR PROGRAMMING RELAXATION; LOWER BOUNDS; LP HIERARCHIES; SHERALI-ADAMS HIERARCHIES;

COMPUTER SCIENCE; CONSTRAINT SATISFACTION PROBLEMS; POLYNOMIAL APPROXIMATION;

LINEAR PROGRAMMING;

EID: 84893493177     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2013.45     Document Type: Conference Paper

References (21)

1. [ABL02] S. Arora, B. Bollobás, and L. Lovász, Proving integrality gaps without knowing the linear program, Proc. FOCS, 2002, pp. 313-322.
2. [ABLT06] S. Arora, B. Bollobás, L. Lovász, and I. Tourlakis, Proving integrality gaps without knowing the linear program, Theory Comput. 2 (2006), 19-51.
3. [BFPS12] Gábor Braun, Samuel Fiorini, Sebastian Pokutta, and David Steurer, Approximation limits of linear programs (beyond hierarchies), FOCS, 2012, pp. 480- 489.
4. [BGMT12] Siavosh Benabbas, Konstantinos Georgiou, Avner Magen, and Madhur Tulsiani, SDP gaps from pairwise independence, Theory of Computing 8 (2012), no. 12, 269-289.
5. [BM13] Mark Braverman and Ankur Moitra, An information complexity approach to extended formulations, STOC, ACM, 2013, pp. 161-170.
6. [CMM09] M. Charikar, K. Makarychev, and Y. Makarychev, Integrality gaps for Sherali-Adams relaxations, Proc. STOC, ACM, 2009, pp. 283-292.
7. [FdlVKM07] Wenceslas Fernándezde la Vega and Claire Kenyon- Mathieu, Linear programming relaxations of Maxcut, SODA, 2007, pp. 53-61.
8. [FFGT11] Y. Faenza, S. Fiorini, R. Grappe, and H. R. Tiwary, Extended formulations, non-negative factorizations and randomized communication protocols, arXiv:1105.4127, 2011.
9. [FMP+12] Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, and Ronald de Wolf, Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds, STOC, 2012, pp. 95-106.
10. [GW95] M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. Assoc. Comput. Mach. 42 (1995), 1115-1145.
11. [Hås01] Johan Håstad, Some optimal inapproximability results, J. ACM 48 (2001), no. 4, 798-859. MR 2144931 (2006c:68066).
12. [Lau03] M. Laurent, A comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre relaxations for 0-1 programming, Math. Oper. Res. (2003), 470-496.
13. [LS91] L. Lovász and A. Schrijver, Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim. 1 (1991), 166-190.
14. [McD98] Colin McDiarmid, Concentration, Probabilistic methods for algorithmic discrete mathematics, Algorithms Combin., vol. 16, Springer, Berlin, 1998, pp. 195-248. MR 1678578 (2000d:60032).
15. [Pas12] K. Pashkovich, Extended formulations for combinatorial polytopes, Ph.D. thesis, Magdeburg Universität, 2012.
16. [SA90] H. D. Sherali and W. P. Adams, A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems, SIAM J. Discrete Math. 3 (1990), 411-430.
17. [Sch08] G. Schoenebeck, Linear level Lasserre lower bounds for certain k-CSPs, Proc. FOCS, IEEE, 2008, pp. 593- 602.
18. [Tsy09] Alexandre B. Tsybakov, Introduction to nonparametric estimation, Springer, 2009.
19. [Vaz01] Vijay V. Vazirani, Approximation algorithms, Springer-Verlag, Berlin, 2001. MR 1851303 (2002h:68001).
20. [WS11] D. P. Williamson and D. B. Shmoys, The design of approximation algorithms, Cambridge University Press, Cambridge, 2011.
21. [Yan91] M. Yannakakis, Expressing combinatorial optimization problems by linear programs, J. Comput. System Sci. 43 (1991), no. 3, 441-466.