The approximability of three-valued MAX CSP

SIAM Journal on Computing

Volumn 35, Issue 6, 2006, Pages 1329-1349

  Jonsson, Peter ^a   Klasson, Mikael ^a   Krokhin, Andrei ^b  

^a LINKÖPING UNIVERSITY   (Sweden)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Approximability; Dichotomy; Maximum constraint satisfaction; Supermodularity

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; POLYNOMIALS; SET THEORY;

APPROXIMABILITY; DICHOTOMY; MAXIMUM CONSTRAINT SATISFACTION; SUPERMODULARITY;

COMPUTATION THEORY;

EID: 33750359817     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753970444644X     Document Type: Article

References (28)

1. G. AUSIELLO, P. CRESZENZI, G. GAMBOSI, V. KANN, A. MARCHETTI-SPACCAMELA, AND M. PROTASI, Complexity and Approximation, Springer-Verlag, New York, 1999.
2. A. BULATOV, A dichotomy theorem for constraints on a 3-element set, in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'02), IEEE Computer Society, Los Alamitos, CA, 2002, pp. 649-658.
3. A. BULATOV, Mal'tsev constraints are tractable, Technical report RR-02-05, Computing Laboratory, Oxford University, Oxford, UK, 2002.
4. A. BULATOV, Tractable conservative constraint satisfaction problems, in Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), IEEE Computer Society, Los Alamitos, CA, 2003, pp. 321-330.
5. A. BULATOV AND V. DALMAU, Towards a dichotomy theorem for the counting constraint satisfaction problem, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03), IEEE Computer Society, Los Alamitos, CA, 2003, pp. 562-571.
6. R. E. BURKARD, B. KLINZ, AND R. RUDOLF, Perspectives of Monge properties in optimization, Discrete Appl. Math., 70 (1996), pp. 95-161.
7. D. COHEN, M. COOPER, P. JEAVONS, AND A. KROKHIN, Supermodular functions and the complexity of Max CSP, Discrete Appl. Math., 149 (2005), pp. 53-72.
8. D. COHEN, P. JEAVONS, AND M. GYSSENS, Closure properties of constraints, J. ACM, 44 (1997), pp. 527-548.
9. N. CREIGNOU, A dichotomy theorem for maximum generalized satisfiability problems, J. Comput. System Sci., 51 (1995), pp. 511-522.
10. N. CREIGNOU, S. KHANNA, AND M. SUDAN, Complexity Classifications of Boolean Constraint Satisfaction Problems, SIAM Monogr. Discrete Math. Appl. 7, SIAM, Philadelphia, 2001.
11. M. DATAR, T. FEDER, A. GIONIS, R. MOTWANI, AND R. PANIGRAHY, A combinatorial algorithm for MAX CSP, Inform. Process. Lett., 85 (2003), pp. 307-315.
12. L. ENGEBRETSEN, The nonapproximability of non-Boolean predicates, SIAM J. Discrete Math., 18 (2004), pp. 114-129.
13. L. ENGEBRETSEN AND V. GURUSWAMI, Is constraint satisfaction over two variables always easy?, Random Structures Algorithms, 25 (2004), pp. 150-178.
14. T. FEDER AND M. Y. VARDI, The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory, SIAM J. Comput., 28 (1998), pp. 57-104.
15. S. FUJISHIGE, Submodular Functions and Optimization, Annals of Discrete Mathematics 47, North-Holland, Amsterdam, 1991.
16. J. HÅSTAD, Some optimal inapproximability results, J. ACM, 48 (2001), pp. 798-859.
17. J. HÅSTAD, Every 2-CSP allows nontrivial approximation, in Proceedings of the 37th ACM Symposium on Theory of Computing (STOC'05), ACM, New York, 2005, pp. 740-746.
18. P. JONSSON, Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights, Theoret. Comput. Sci., 244 (2000), pp. 189-203.
19. S. KHANNA, M. SUDAN, L. TREVISAN, AND D. P. WILLIAMSON, The approximability of constraint satisfaction problems, SIAM J. Comput., 30 (2001), pp. 1863-1920.
20. C. LUND AND M. YANNAKAKIS, The approximation of maximum subgraph problems, in Automata, Languages, and Programming (ICALP'93), Lecture Notes in Comput. Sci. 700, Springer-Verlag, Berlin, 1993, pp. 40-51.
21. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation, and complexity classes, J. Comput. System Sci., 43 (1991), pp. 425-440.
22. T. J. SCHAEFER, The complexity of satisfiability problems, in Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC'78), ACM, New York, 1978, pp. 216-226.
23. M. SERNA, L. TREVISAN, AND F. XHAFA, The (parallel) approximability of non-boolean satisfiability problems and restricted integer programming, in Proceedings STACS'98, Lecture Notes in Comput. Sci. 1373, Springer-Verlag, Berlin, 1998, pp. 488-498.
24. D. TOPKIS, Supermodularity and Complementarity, Princeton University Press, Princeton, NJ, 1998.
25. L. TREVISAN, Inapproximability of Combinatorial Optimization Problems, Technical report 65, Electronic Colloquium on Computational Complexity, 2004.
26. L. TREVISAN, G. B. SORKIN, M. SUDAN, AND D. P. WILLIAMSON, Gadgets, approximation, and linear programming, SIAM J. Comput., 29 (2000), pp. 2074-2097.
27. D. ZUCKERMAN, On unapproximable versions of NP-complete problems, SIAM J. Comput., 25 (1996), pp. 1293-1304.
28. U. ZWICK, Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint, in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'98), ACM, New York, SIAM, Philadelphia, 1998, pp. 201-210.