Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 355-364

  Pitassi, Toniann ^a   Segerlind, Nathan ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED SOFTWARE ENGINEERING; LINEAR MATRIX INEQUALITIES; MACHINERY;

BOOLEAN SATISFIABILITY; COMBINATORIAL PROBLEM; CUTTING PLANES; GENERIC ARGUMENTS; INTEGRALITY GAPS; LINEAR INEQUALITIES; LINEAR RELAXATIONS; LOWER BOUNDS;

FORESTRY;

EID: 70349096772     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.40     Document Type: Conference Paper

References (27)

1. M. Alekhnovich, Lower bounds for k-DNF resolution on random 3-CNFs. In Proceedings of the Thirty-Seventh Annual ACM Symposium on the Theory of Computing, pages 251-256, 2005. (Pubitemid 43098594)
2. M. Alekhnovich, S. Arora, and I. Tourlakis. Towards strong nonapproximability results in the lovasz-schrijver hierarchy, In STOC, pages 294-303, 2005. (Pubitemid 43098599)
3. M. Alekhnovich, E. Hirsch, and D. Itsykson. Exponential lower bounds for the running times of DPLL algorithms on satisfiable formulas. Journal of Automated Reasoning, 35(1-3):51-72, 2005. (Pubitemid 44619279)
4. M. Alekhnovich and A. Razborov. Lower bounds for the polynomial calculus: Non-binomial case. In Proceedings of the Forty-Second Annual IEEE Symposium on Foundations of Computer Science, pages 190-199, 2001. (Pubitemid 33068379)
5. S. Arora, B. Bollobas, L. Lovasz, and I. Tourlakis. Proving integrality gaps without knowing the linear program. Theory of Computing, 2(2):19-51, 2006.
6. S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings, and graph partitioning. In Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing, pages 222-231, 2004.
7. P. Austrin. Towards sharp inapproximability for any 2csp. In FOCS, pages 307-317, 2007.
8. J. Buresh-Oppenheim, N. Galesi, S. Hoory, A. Magen, and T. Pitassi. Rank bounds and integrality gaps for cutting planes procedures. Theory of Computing, 2:65-90, 2006.
9. S. Buss, D. Grigoriev, R. Impagliazzo, and T. Pitassi. Linear gaps between degrees for the polynomial calculus modulo distinct primes. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pages 547-556, Atlanta, GA, May 1999.
10. M. Charikar, K. Makarychev, and Y. Makarychev. Integrality gaps for sherali-adams relaxations, 2007.
11. M. Clegg, J. Edmonds, and R. Impagliazzo. Using the Gröbner basis algorithm to find proofs of unsatisfiability. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pages 174-183, Philadelphia, PA, May 1996.
12. S. Dash. On the matrix cuts of Lovász and Schrijver and their use in Integer Programming. PhD thesis, Department of Computer Science, Rice University, March 2001.
13. W. de la Vega and C. Kenyon-Mathiew. Linear programming relaxations of maxcut. In SODA, 2007.
14. M. Goemans and D. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42(6):1115-1145, 1995.
15. D. Grigoriev. Linear lower bound on degrees of positivstellensatz calculus proofs for the parity. Theoretical Computer Science, 259:613-622, 2001.
16. D. Grigoriev, E. Hirsch, and D. Pasechnik. Complexity of semialgebraic proofs. Moscow Mathematical Journal, 2:647-679, 2002.
17. D. Grigoriev and E. Hirsh. Algebraic proof systems over formulas. Theoretical Computer Science, 303:83-102, 2003.
18. D, Grigoriev and N. Vorobjov, Complexity of null-and positivestellensatz proofs. Annals of Pure and Applied Logic, 113:153-160, 2001.
19. A. Kojevnikov and D. Itsykson. Lower bounds of statis lovasz-schrijver calculus proofs for tseitin tautologies. In ICALP, pages 323-334, 2006.
20. G. Konstantinos, A. Magen, T., Pitassi, and I. Tourlakis, Optimal integrality gaps for lovasz-schrijver relaxations of vertex cover. In ECCC, 2006.
21. L. Lovász. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, 25:1-7, 1979. (Pubitemid 9413535)
22. L. Lovasz and A. Schrijver. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optimization, 1(2):166-190, 1991.
23. T. Pitassi and N. Segerlind. Exponential lower bounds and integrality gaps for tree-like Lovasz-Schrijver procedures. Electronic Colloquium on Computational Complexity, Technical Report TR07-107. Web address: http://eccc.hpi-web.de
24. P. Raghavendra. Optimal algorithms and inapproximability results for every csp? In STOC, pages 245-254, 2008.
25. G. Schoenebeck, L. Trevisan, and M. Tulsiani. A linear round lower bound for lovasz-schrijver sdp relaxations of vertex cover. In ECCC, number 98, 2006.
26. G. Schoenebeck, L. Trevisan, and M. Tulsiani. Tight integrality gaps for lovasz-schrijver lp relaxations of vertex cover and max cut. In ECCC, 2006.
27. I. Tourlakis. New lower bounds for vertex cover in the lovasz-schrijver hierarchy. In IEEE Conference on Computational Complexity, 2006.