Near-optimal algorithms for maximum constraint satisfaction problems

ACM Transactions on Algorithms

Volumn 5, Issue 3, 2009, Pages

  Charikar, Moses ^a   Makarychev, Konstantin ^b   Makarychev, Yury ^c  

^a Princeton University   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

MAX 2CSP; MAX k CSP; SDP

Indexed keywords

BEST-KNOWN ALGORITHMS; MAX 2CSP; MAX K-CSP; MAXIMUM CONSTRAINT SATISFACTION PROBLEMS; NEAR-OPTIMAL ALGORITHMS; SDP; SEMIDEFINITE PROGRAMMING RELAXATIONS; UNIQUE GAMES CONJECTURE;

BOOLEAN FUNCTIONS; COMPUTER OPERATING PROCEDURES; STEELMAKING;

APPROXIMATION ALGORITHMS;

EID: 68549140043     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1541885.1541893     Document Type: Article

References (22)

1. AGARWAL, A., CHARIKAR, M., MAKARYCHEV, K., AND MAKARYCHEV, Y. 2005. O(√log n) approximation algorithms for MIN Uncut, MIN 2CNF deletion, and directed cut problems. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing. ACM, New York, 573-581.
2. AUSTRIN, P. 2007a. Balanced MAX 2-SAT might not be the hardest. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing. ACM, New York, 189-197.
3. AUSTRIN, P. 2007b. Towards sharp inapproximability for any 2-CSP. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, Los Alamitos, 307-317.
4. AUSTRIN, P., AND MOSSEL, E. 2008. Approximation resistant predicates from pairwise independence. In Proceedings of the IEEE 23rd Annual Conference on Computational Complexity. IEEE Computer Society, Los Alamitos, 249-258.
5. AZAR, Y., MOTWANI, R., AND NAOR, J. 1998. Approximating probability distributions using small sample spaces. Combinatorica 18, 2, 151-171.
6. CHARIKAR, M., AND WIRTH, A. 2004. Maximizing quadratic programs: Extending Grothendieck's inequality. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, Los Alamitos, 54-60.
7. FEIGE, U., AND GOEMANS, M. X. 1995. Approximating the value of two prover proof systems, with applications to MAX-2SAT and MAX DICUT. In Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems, 182-189.
8. GOEMANS, M. X., AND WILLIAMSON, D. P. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semi-definite programming. J. ACM 42, 6, 1115-1145.
9. GURUSWAMI, V., AND RAGHAVENDRA, P. 2008. Constraint satisfaction over a non-boolean domain: Approximation algorithms and unique-games hardness. In Proceedings of APPROX-RANDOM. 77-90.
10. HAST, G. 2005. Approximating MAX kCSP - Out-performing a random assignment with almosta linear factor. In Proceedings of ICALP, 956-968.
11. HÅSTAD, J. 2001. Some optimal inapproximability results. J. ACM 48, 4, 798-859.
12. KHOT, S. 2002. On the power of unique 2-prover 1-round games. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing. ACM, New York, 767-775.
13. KHOT, S., KINDLER, G., MOSSEL, E., AND O'DONNELL, R. 2007. Optimal inapproximability results for MAX-CUT and other two-variable CSPs? SIAM J. Comput. 37, 1, 319-357.
14. LEWIN, M., LIVNAT, D., AND ZWICK, U. 2002. Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems. In Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization. Springer-Verlag, 67-82.
15. MATUURA, S. AND MATSUI, T. 2003. New approximation algorithms for MAX 2SAT and MAX DICUT. J. Oper. Res. Soc. Japan 46, 178-188.
16. NESTEROV, Y. 1997. Quality of semi-definite relaxation for nonconvex quadratic optimization. CORE Discussion Paper 9719.
17. RAGHAVENDRA, P. 2008. Optimal algorithms and inapproximability results for every CSP? In Proceedings of the 40th Annual ACM Symposium on Theory of Computing. ACM, New York, 245-254.
18. RIETZ, R. E. 1974. A proof of the Grothendieck inequality. Israel J. Math 19, 3, 271-276.
19. SAMORODNITSKY, A., AND TREVISAN, L. 2006. Gowers uniformity, influence of variables, and PCPs. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing. ACM, New York, 11-20.
20. TREVISAN, L. 1998. Parallel approximation algorithms by positive linear programming. Algorithmica 21, 1, 72-88.
21. ZWICK, U. 1998. Finding almost-satisfying assignments. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing. ACM, New York, 551-560.
22. ZWICK, U. 2000. Analyzing the MAX 2-SAT and MAX DI-CUT approximation algorithms of Feige and Goemans. www.cs.tau.ac.il/∼zwick/my- online-papers.html.