Abstract
By the breakthrough work of Håstad, several constraint satisfaction problems are now known to have the following approximation resistance property: satisfying more clauses than what picking a random assignment would achieve is NP-hard. This is the case for example for Max E3-Sat, Max E3-Lin and Max E4-Set Splitting. A notable exception to this extreme hardness is constraint satisfaction over two variables (2-CSP); as a corollary of the celebrated Goemans-Williamson algorithm, we know that every Boolean 2-CSP has a non-trivial approximation algorithm whose performance ratio is better than that obtained by picking a random assignment to the variables. An intriguing question then is whether this is also the case for 2-CSPs over larger, non-Boolean domains. This question is still open, and is equivalent to whether the generalization of Max 2-SAT to domains of size d, can be approximated to a factor better than (1 - x1/d 2).
In an attempt to make progress towards this question, in this paper we prove, firstly, that a slight restriction of this problem, namely a generalization of linear inequations with two variables per constraint, is not approximation resistant, and, secondly, that the Not-All-Equal Sat problem over domain size d with three variables per constraint, is approximation resistant, for every d ≥ 3. In the Boolean case, Not-All-Equal Sat with three variables per constraint is equivalent to Max 2-SAT and thus has a non-trivial approximation algorithm; for larger domain sizes, Max 2-SAT can be reduced to Not-All-Equal Sat with three variables per constraint. Our approximation algorithm implies that a wide class of 2-CSPs called regular 2-CSPs can all be approximated beyond their random assignment threshold.
Research partly performed while the author was visiting MIT with support from the Marcus Wallenberg Foundation and the Royal Swedish Academy of Sciences.
Supported by a Miller Research Fellowship.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gunnar Andersson. Some New Randomized Approximation Algorithms. Doctoral dissertation, Department of Numerical Analysis and Computer Science, Royal Institute of Technology, May 2000.
Gunnar Andersson, Lars Engebretsen, and Johan Håstad. A new way of using semidefinite programming with applications to linear equations mod p. Journal of Algorithms, 39(2):162–204, May 2001.
Alan Frieze and Mark Jerrum. Improved approximation algorithms for MAX k- CUT and MAX BISECTION. Algorithmica, 18:67–81, 1997.
Michel X. Goemans and David P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42(6):1115–1145, November 1995.
Michel X. Goemans and David P. Williamson. Approximation algorithms for Max-3-Cut and other problems via complex semidefinite programming. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pages 443–452. Hersonissos, Crete, Grece, 6–8 July 2001.
Johan Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798–859, July 2001.
Viggo Kann, Sanjeev Khanna, Jens Lagergren, and Alessandro Panconesi. On the hardness of approximating Max k-Cut and its dual. Chicago Journal of Theoretical Computer Science, 1997(2), June 1997.
Subhash Khot. Hardness results for coloring 3-colorable 3-uniform hypergraphs. To appear in Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science. Vancouver, Canada, 16-19 November 2002.
Subhash Khot. On the power of unique 2-prover 1-round games. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 767–775. Montréal, Québec, Canada, 19–21 May 2002.
Erez Petrank. The hardness of approximation: Gap location. Computational Complexity, 4(2):133–157, 1994.
Uri Zwick. Approximation algorithms for constraint satisfaction programs involving at most three variables per constraint. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 201–210. San Francisco, California, 25-27 January 1998.
Uri Zwick. Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pages 679–687. Atlanta, Georgia, 1-4 May 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Engebretsen, L., Guruswami, V. (2002). Is Constraint Satisfaction Over Two Variables Always Easy?. In: Rolim, J.D.P., Vadhan, S. (eds) Randomization and Approximation Techniques in Computer Science. RANDOM 2002. Lecture Notes in Computer Science, vol 2483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45726-7_18
Download citation
DOI: https://doi.org/10.1007/3-540-45726-7_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44147-2
Online ISBN: 978-3-540-45726-8
eBook Packages: Springer Book Archive