Near-optimal algorithms for maximum constraint satisfaction problems

ABSTRACT

In this paper we present approximation algorithms for the maximum constraint satisfaction problem with k variables in each constraint (MAX k-CSP).

Given a (1 - ε) satisfiable 2CSP our first algorithm finds an assignment of variables satisfying a 1 - O(√ε) fraction of all constraints. The best previously known result, due to Zwick, was 1 - O(ε^1/3).

The second algorithm finds a ck/2^k approximation for the MAX k-CSP problem (where c > 0.44 is an absolute constant). This result improves the previously best known algorithm by Hast, which had an approximation guarantee of Ω(k/(2^klog k)).

Both results are optimal assuming the Unique Games Conjecture and are based on rounding natural semidefinite programming relaxations. We also believe that our algorithms and their analysis are simpler than those previously known.

REFERENCES

• 1: Amit Agarwal , Moses Charikar , Konstantin Makarychev , Yury Makarychev, O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, May 22-24, 2005, Baltimore, MD, USA [doi>10.1145/1060590.1060675]
• 2: P. Austrin Balanced Max 2-Sat might not be the hardest. ECCC Report TR06--088, 2006.
• 3: Moses Charikar , Anthony Wirth, Maximizing Quadratic Programs: Extending Grothendieck's Inequality, Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, p.54-60, October 17-19, 2004 [doi>10.1109/FOCS.2004.39]
• 4: Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT, Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95), p.182, January 04-06, 1995
• 5: Michel X. Goemans , David P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal of the ACM (JACM), v.42 n.6, p.1115-1145, Nov. 1995 [doi>10.1145/227683.227684]
• 6: G. Hast. Approximating Max kCSP --- Outperforming a Random Assignment with Almost a Linear Factor. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, pp. 956--968, 2005.
• 7: Johan Håstad, Some optimal inapproximability results, Journal of the ACM (JACM), v.48 n.4, p.798-859, July 2001 [doi>10.1145/502090.502098]
• 8: Subhash Khot, On the power of unique 2-prover 1-round games, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada [doi>10.1145/509907.510017]
• 9: Subhash Khot , Guy Kindler , Elchanan Mossel , Ryan O'Donnell, Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?, Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, p.146-154, October 17-19, 2004 [doi>10.1109/FOCS.2004.49]
• 10: Michael Lewin , Dror Livnat , Uri Zwick, Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems, Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization, p.67-82, May 27-29, 2002
• 11: S. Matuura and T. Matsui. New approximation algorithms for MAX 2SAT and MAX DICUT, Journal of Operations Research Society of Japan, vol. 46, 2003, pp. 178--188.
• 12: Y. Nesterov. Quality of semidefinite relaxation for nonconvex quadratic optimization. CORE Discussion Paper 9719, March 1997.
• 13: Alex Samorodnitsky , Luca Trevisan, Gowers uniformity, influence of variables, and PCPs, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, May 21-23, 2006, Seattle, WA, USA [doi>10.1145/1132516.1132519]
• 14: L. Trevisan. Parallel Approximation Algorithms by Positive Linear Programming. Algorithmica, Vol. 21, No. 1, pp. 72--88, 1998.
• 15: U. Zwick. Analyzing the MAX 2-SAT and MAX DI-CUT approximation algorithms of Feige and Goemans. Manuscript. Available at www.cs.tau.ac.il/~zwick/my-online-papers.html.
• 16: Uri Zwick, Finding almost-satisfying assignments, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.551-560, May 24-26, 1998, Dallas, Texas, United States [doi>10.1145/276698.276869]