Improving integrality gaps via Chvátal-Gomory rounding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6302 LNCS, Issue , 2010, Pages 366-379

  Singh, Mohit ^a   Talwar, Kunal ^b  

^a MCGILL UNIVERSITY   (Canada)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78149309451     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15369-3_28     Document Type: Conference Paper

References (41)

1. Arora, S., Bollobás, B., Lovász, L., Tourlakis, I.: Proving Integrality Gaps without Knowing the Linear Program. Theory of Computing 2(1), 19-51 (2006)
2. Arora, S., Bollobás, B., Lovász, L.: Proving Integrality Gaps without Knowing the Linear Program. In: Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS), pp. 313-322 (2002)
3. Beame, P., Huynh, T., Pitassi, T.: Hardness amplification in proof complexity. In: Proceedings of the Fourty-Second Annual ACM Symposium on Theory of Computing, STOC (2010)
4. Berman, P., Karpinski, M.: Improved Approximation Lower Bounds on Small Occurrence Optimization. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 10, p. 008 (2003)
5. Bienstock, D., Zuckerberg, M.: Approximate fixed-rank closures of covering problems. Math. Program. 105(1), 9-27 (2006)
6. Bockmayr, A., Eisenbrand, F., Hartmann, M.E., Schulz, A.S.: On the Chvtal Rank of Polytopes in the 0/1 Cube. Discrete Applied Mathematics 98(1-2), 21-27 (1999) (Pubitemid 129639764)
7. Buresh-Oppenheim., J., Galesi, N., Hoory, S., Magen, A., Pitassi, T.: Rank Bounds and Integrality Gaps for Cutting Planes Procedures. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, October 11-14 (2003)
8. Calczyńska-Karlowicz, M.: Theorem on Families of Finite Sets. Bulletin de lAcadémie Polonaise des Sciences. Série des Sciences Mathématiques, Astronomiques et Physiques 12, 87-89 (1964)
9. Chan, Y.H., Lau, L.C.: On Linear and Semidefinite Programming Relaxations for Hypergraph Matching. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA) (January 2010)
10. Charikar, M., Makarychev, K., Makarychev, Y.: Integrality Gaps for Sherali-Adams Relaxations. In: Proceedings of the 41st Annual ACM Symposium on theory of Computing, STOC 2009, pp. 283-292 (2009)
11. Chvátal, V.: Edmonds Polytopes and a Hierarchy of Combinatorial Problems. Discrete Math. 4, 305-337 (1973)
12. Chvátal, V., Cook, W., Hartmann, M.: On Cutting-Plane Proofs in Combinatorial Optimization. Linear Algebra and its Applications 114/115, 455-499 (1989)
13. Cornuéjols, G.: Revival of the Gomory cuts in the 1990's. Annals of Operations Research 149(1), 63-66 (2007)
14. Dash, S.: On the Matrix Cuts of Lovsz and Schrijver and their use in Integer Programming. PhD thesis, Department of Computer Science, Rice University (March 2001)
15. Dash, S.: An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 145-160. Springer, Heidelberg (2002)
16. de la Vega, W.F., Kenyon-Mathieu, C.: Linear Programming Relaxations of Max-cut. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2007, pp. 53-61 (2007)
17. Eisenbrand, F.: On the Membership Problem for the Elementary Closure of a Polyhedron. Combinatorica 19, 297-300 (1999)
18. Eisenbrand, F., Schulz, A.S.: Bounds on the Chvtal rank of polytopes in the 0/1-cube. Combinatorica 23, 245-261 (2003) (Pubitemid 37206818)
19. Erdös, P., Lovász, L.: Problems and Results on 3- chromatic Hypergraphs and Some Related Questions. In: Hajnal, A., Rado, R., Sós, V.T. (eds.) Proceedings of Colloquia Mathematica Societatis János Bolyai, Infinite and Finite Sets, vol. 10, pp. 609-627. Keszthely, Hungary (1973)
20. Eisenbrand, F., Schulz, A.S.: Bounds on the chvátal rank of polytopes in the 0/1-cube. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 137-150. Springer, Heidelberg (1999)
21. Goemans, M.X., Tuncel, L.: When does the Positive Semidefiniteness Constraint help in Lifting Procedures. Mathematics of Operations Research 26, 796-815 (2001)
22. Gomory, R.E.: Outline of an Algorithm for Integer Solutions to Linear Programs. Bulletin of the American Mathematical Society 64(5), 275-278 (1958)
23. Gomory, R.E.: Solving Linear Programming Problems in Integers. In: Bellman, R., Hall Jr., M. (eds.) Combinatorial Analysis. Symposia in Applied Mathematics X, pp. 211-215. American Mathematical Society, Providence (1960)
24. Georgiou, K., Magen, A., Pitassi, T., Tourlakis, I.: Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovsz-Schrijver Hierarchy. In: Proceedings of the 50th Annual Symposium on Foundations of Computer Science (FOCS), pp. 702-712 (2007)
25. Gupta, A., Talwar, K.: Approximating Unique Games. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm SODA 2006, pp. 99-106. ACM, New York (2006)
26. Hazan, E., Safra, M., Schwartz, O.: On the Complexity of Approximating k-Dimensional Matching. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 59-70. Springer, Heidelberg (2003)
27. Hurkens, C.A.J., Schrijver, A.: On the Size of Systems of Sets Every t of which have an SDR, with an Application to the Worst-case Ratio of Heuristics for Packing Problems. SIAM Journal on Discrete Mathematics 2, 68-72 (1989)
28. 1- Embeddability. In: Proceedings of the 50th Annual Symposium on Foundations of Computer Science, FOCS (2009)
29. Lasserre, J.B.: An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 293-303. Springer, Heidelberg (2001)
30. Laurent, M.: A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming. Mathematics of Operations Research 28(3), 470-496 (2003)
31. Lovász, L., Schrijver, A.: Cones of Matrices and Set-functions and 0-1 Optimization. SIAM J. Optimization 1(2), 166-190 (1991)
32. Mathieu, C., Sinclair, A.: Sherali-Adams Relaxations of the Matching Polytope. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 293-302 (2009)
33. Pitassi, T., Segerlind, N.: Exponential lower bounds and Integrality gaps for Tree-like Lovsz-Schrijver Procedures. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, New York, January 04-06 (2009)
34. Pudlák, P.: Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations. Journal of Symbolic Logic 62(3), 981-998 (1997)
35. Raghavendra, P., Steurer, D.: Integrality Gaps for Strong SDP Relaxations of Unique Games. In: Proceedings of the 50th Annual Symposium on Foundations of Computer Science, FOCS (2009)
36. Schoenebeck, G.: Linear Level Lasserre Lower Bounds for Certain k-CSPs. In: Proceedings of the 50th Annual Symposium on Foundations of Computer Science (FOCS), pp. 593-602 (2008)
37. Sherali, H.D., Adams, W.P.: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems. SIAM J. Discrete Math. 3(3), 411-430 (1990)
38. Singh, M., Talwar, K.: Improving Integrality Gaps via chvátal-Gomory Rounding (2010) (manuscript)
39. Tulsiani, M.: CSP gaps and Reductions in the Lasserre Hierarchy. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 303-312 (2009)
40. Tuza, Z.: Critical Hypergraphs and Intersecting Set-pair Systems. Journal of Combinatorial Theory (B) 39, 134-145 (1985)
41. Tuza, Z.: On Two Intersecting Set Systems and k- continuous Boolean functions. Discrete Applied Mathematics 16, 183-185 (1987)