Balanced max 2-sat might not be the hardest

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 189-197

  Austrin, Per ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Inapproximability; Max 2 Sat; Unique games conjecture

Indexed keywords

APPROXIMATION ALGORITHMS; ROUGH SET THEORY;

INAPPROXIMABILITY; MAX 2-SAT; UNIQUE GAMES CONJECTURE;

GAME THEORY;

EID: 35448957666     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250818     Document Type: Conference Paper

References (33)

1. F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization, 5:13-51, 1995.
2. S. Arora, E. Chlamtac, and M. Charikar. New Approximation Guarantee for Chromatic Number. In STOC 2006, pages 205-214, 2006.
3. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof Verification and the Hardness of Approximation Problems. Journal of the ACM, 45(3):501-555, 1998.
4. S. Arora and S. Safra. Probabilistic Checking of Proofs: A New Characterization of NP. Journal of the ACM, 45(1):70-122, 1998.
5. P. Austrin. Balanced Max 2-Sat might not be the hardest. Technical report, Electronic Colloquium, on Computational Complexity Report TR06-088, 2006.
6. 3/14)-coloring algorithm for 3-colorable graphs. Information Processing Letters, 61(1):49-53, 1997.
7. M. Charikar, K. Makarychev, and Y. Makarychev. Approximation Algorithm, for the Max k-CSP Problem, 2006.
8. M. Charikar, K. Makarychev, and Y. Makarychev. Near-optimal, algorithms for unique games. In STOC 2006, pages 205-214, 2006.
9. M. Charikar and A. Wirth. Maximizing Quadratic Programs: Extending Grothendieck's Inequality. In FOCS 2004, pages 54-60, 2004.
10. S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, and D. Sivakumar. On the hardness of approximating multicut and sparsest-cut. In 20th Annual IEEE Conference on Computational Complexity, pages 144-153, June 2005.
11. P. Crescenzi, R. Silvestri, and L. Trevisan. On Weighted vs Unweighted Versions of Combinatorial Optimization Problems, information and Computation, 167(1): 10-26, 2001.
12. I. Dinur, E. Mossel, and O. Regev. Conditional hardness for approximate coloring. In STOC 2006, pages 344-353, 2006.
13. U. Feige. A threshold of In n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
14. U. Feige and M. Goemans. Aproximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DICUT. In ISTCS 1995, pages 182-189, 1995.
15. U. Feige and J. Kilian. Zero Knowledge and the Chromatic Number. Journal of Computer and System Sciences, 57(2):187-199, 1998.
16. M. X. Goemans and D. P. Williamson. Improved Approximation Algorithms for Maximum, Cut and Satisfiability Problems Using Semidefinite Programming. Journal of the ACM, 42:1115-1145, 1995.
17. E. Halperin, R. Nathaniel, and U. Zwick. Coloring k-colorable graphs using smaller palettes. In SODA 2001, pages 319-326, 2001.
18. G. Hast. Approximating Max kCSP - Outperforming a Random Assignment with Almost a Linear Factor. In ICALP 2005, pages 956-968, 2005.
19. 1-∈. Acta Mathematica, 48(4):105-142, 1999.
20. J. Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, 2001.
21. J. Håstad. On the approximation resistance of a random predicate. Manuscript, 2006.
22. D. R. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. Journal of the ACM, 45(2):246-265, 1998.
23. S. Khot. On the power of unique 2-prover 1-round games. In STOC 2002, pages 767-775, 2002.
24. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal Inapproximability Results for Max-Cut and. Other 2-Variable CSPs? In FOCS 2004, pages 146-154. IEEE Computer Society, 2004.
25. S. Khot and R. O'Donnell. SDP gaps and UGC-hardness for MAXCUTGAIN. In FOCS, pages 217-226. IEEE Computer Society, 2006.
26. S. Khot and O. Regev. Vertex Cover Might be Hard to Approximate to within 2 -e. In IEEE Conference on Computational Complexity, pages 379-. IEEE Computer Society, 2003.
27. S. Khot and, N. K. Vishnoi. The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into I1. In FOCS 2005, pages 53-62, 2005.
28. M. Lewin, D. Livnat, and U. Zwick. Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems. In IPCO 2002, volume 2337 of Lecture Notes in Computer Science, pages 67-82, 2002.
29. S. Matuura and T. Matsui. 0.863-approximation algorithm for max dicut. In RANDOM-APPROX, pages 138-146, 2001.
30. S. Matuura and T. Matsui. 0.935-Approximation Randomized Algorithm for MAX 2SAT and Its Derandomization. Technical Report METR 2001-03, Department of Mathematical Engineering and Information Physics, the University of Tokyo, Japan, 2001.
31. E. Mossel, R. O'Donnell, and K. Oleszkiewi.cz. Noise stability of functions with low influences: invariance and optimality. Preprint, 2005.
32. A. Samorodnitsky and L. Trevisan. Gowers uniformity, influence of variables, and PCPs. In STOC 2006, pages 11-20, 2006.
33. U. Zwick. Personal communication, 2005.