Every 2-CSP allows nontrivial approximation

Computational Complexity

Volumn 17, Issue 4, 2008, Pages 549-566

  Håstad, Johan ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Approximation algorithms; Constraint satisfaction; Semi definite programming

Indexed keywords

EID: 57349107952     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-008-0256-y     Document Type: Article

References (28)

1. F. ALIZADEH (1995). Interior point methods in semidefmite programming with applications to combinatorial optimization. SIAM Journal on Optimization 5, 13-51.
2. G. ANDERSSON, L. ENGEBRETSEN & J. HÅSTAD (2001). A new way to use semidefinite programming with applications to linear equations mod p. Journal of Algorithms 39, 162-204.
3. S. ARORA, E. CHLAMTAC & M. CHARIKAR (2006). New approximation guarantee for chromatic number. In Proceedings of the 38th Annual ACM Symposium on Theory of Computating, 215-224.
4. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN & M. SZEGEDY (1998). Proof verification and intractability of approximation problems. Journal of the ACM 45, 501-555.
5. M. CHARIKAR & A. WIRTH (2004). Maximizing quadratic programs: extending Grothendieck's inequality. In Proceedings of 45th Annual IEEE Symposium, of Foundations of Computer Science, 54-60.
6. S. COOK (1971). The complexity of theorem proving procedures. In 3rd Annual ACM Symposium on Theory of Computing, 151-158.
7. N. CREIGNOU (1995). A dichotomy theorem for maximum generlized satisfiability problems. Journal of Computer and System Science 52, 511-522.
8. N. CREIGNOU, S. KHANNA & M. SUDAN (2001). Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications 7, Philadelphia, PA, USA.
9. I. DINUR. (2006). The PCP Theorem by gap amplification. In Proceedings of 38th Annual ACM symposium on Theory of Computing, 241-250.
10. L. ENGEBRETSEN & V. GURUSWAMI (2004). Is constraint satisfaction over two variables always easy? Random Structures and Algorithms 25, 150-178.
11. U. FEIGE (1998). A threshold of ln n for approximating set cover. Journal of the ACM 45, 634-652.
12. U. FEIGE & J. KILIAN (1998). Zero-knowledge and the chromatic number. Journal of Computer and System Sciences 57, 187-200.
13. U. FEIGE & D. REICHMAN (2004). On systems of linear equations with two variables per equation. In Approximation, Randomization and Combinatorial Optimization, K. JANSEN, S. KHANNA, J. ROLIM & D. RON, editors, 117-127. Proceedings of Approx 2004 and Random 2004, LNCS 3122.
14. M. R. GAREY & D. S. JOHNSON (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, NY, USA.
15. M. GOEMANS & D. WILLIAMSON (1995). Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 42, 1115-1145.
16. M. GRÖTSCHEL1 L. LOVÁSZ & A. SCHRIJVER (1981). The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169-197.
17. E. HALPERIN & U. ZWICK (2001). Approximation algorithms for Max 4-Sat and rounding procedures for semidefinite programs. Journal of Algorithms 40, 184-211.
18. G. HAST (2005). Beating a random assignment. KTH, Stockholm. Ph.D Thesis.
19. 1-∈. Acta Mathematica 182, 105-142.
20. J. HÅSTAD (2001). Some optimal inapproximability results. Journal of ACM 48, 798-859.
21. J. HÅSTAD (2005). Every 2-CSP Allows Nontrivial Approximation. In Proceedings of the 37th Annual ACM Symposium, on Theory of Computating, 740-746.
22. S. KHANNA, M. SUDAN, L. TREVISAN & D. P. WILLIAMSON (2000). A approximability of constraint satisfaction problems. SIAM Journal on Computing 30, 1863-1920.
23. S. KHOT (2001). Improved inapproximability results for maxclique and chromatic number. In Proceedings of 42nd Annual IEEE Symposium of Foundations of Computer Science, 600-609.
24. S. KHOT, E. MOSSEL, G. KINDLER & R. O'DONNELL (2007). Optimal inapproximability results for Max-Cut and other 2-variabIe CSPs? SIAM Journal on Computing 37, 319-357.
25. A. SAMORODNITSKY & L. TREVISAN (2000). A PCP characterization of NP with optimal amortized query complexity. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 191-199.
26. T. SCHAEFER (1978). The complexity of satisfiability problems. In Conference record of the Tenth annual ACM Symposium on Theory of Computing, 216-226.
27. U. ZWICK (1998). Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In Proceedings 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 201-210. ACM.
28. U. ZWICK (1999). Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems. In Proceedings 31st ACM Symposium on Theory of Computing, 679-687. ACM.