Ruling out polynomial-time approximation schemes for hard constraint satisfaction problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4649 LNCS, Issue , 2007, Pages 182-193

  Jonsson, Peter ^a   Krokhin, Andrei ^b   Kuivinen, Fredrik ^a  

^a Department of Computer and Information Science   (Sweden)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Approxima bility; Complexity; Maximum constraint satisfaction

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; POLYNOMIAL APPROXIMATION;

APPROXIMABILITY; COMPUTATIONAL PROBLEMS; CONSTRAINT SATISFACTION PROBLEMS; FINITE COLLECTION;

PROBLEM SOLVING;

EID: 37249065166     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74510-5_20     Document Type: Conference Paper

References (20)

1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Prctasi, M.: Complexity and approximation: Combinatorial Optimization Problems and their Approximability Properties. Springer, Heidelberg (1999)
2. Bulatov, A.: Tractable conservative constraint satisfaction problems. In: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (LICS '03), pp. 321-330. IEEE Computer Society Press, Los Alamitos (2003)
3. Bulatov, A.: A dichotomy theorem for constraint satisfaction problems on a 3element set. J. ACM 53(1), 66-120 (2006)
4. Bulatov, A., Jeavons, P., Krokhin, A.: Classifying the complexity of constraints using finite algebras. SIAM J. Comput. 34(3), 720-742 (2005)
5. Burris, S., Sankappanavar, H.: A Course in Universal Algebra. Springer, Heidelberg (1981)
6. Cohen, D., Cooper, M., Jeavons, P., Krokhin, A.: Supermodular functions and the complexity of Max CSP. Discrete Appl. Math. 149(1-3), 53-72 (2005)
7. Dalmau, V., Jeavons, P.: Learnability of quantified formulas. Theor. Comput. Sci. 306, 485-511 (2003)
8. Deineko, V., Jonsson, P., Klasson, M., Krokhin, A.: Supermodularity on chains and complexity of maximum constraint satisfaction. In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), volume AE of DMTCS Proceedings, pp. 51-56, 2005. Discrete Mathematics and Theoretical Computer Science, Full version available as The approximability of Max CSP with fixed-value constraints, arXiv.org:cs.CC/0602075 (2005)
9. Feder, T., Hell, P., Huang, J.: List homomorphisms of graphs with bounded degrees. Discrete Math. 307, 386-392 (2007)
10. Hell, P., Nešetřil, J.: Graphs and Homomorphisms. Oxford University Press, Oxford (2004)
11. Jonsson, P., Klasson, M., Krokhin, A.: The approximability of three-valued Max CSP. SIAM J. Comput. 35(6), 1329-1349 (2006)
12. Jonsson, P., Krokhin, A.: Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights. J. Comput. System Sci. 73(5), 691-702 (2007)
13. Khanna, S., Sudan, M., Trevisan, L., Williamson, D.P.: The approximability of constraint satisfaction problems. SIAM J. Comput. 30(6), 1863-1920 (2000)
14. Krokhin, A., Larose, B.: Maximum constraint satisfaction on diamonds. Technical Report CS-RR-408, University of Warwick, UK (2004)
15. Krokhin, A., Larose, B.: Maximum constraint satisfaction on diamonds. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 388-402. Springer, Heidelberg (2005)
16. MacGillivray, G.: On the complexity of colouring by vertex-transitive and arctransistive digraphs. SIAM J. Discret. Math. 4(3), 397-408 (1991)
17. Petrank, E.: The hardness of approximation: Gap location. Computational Complexity 4, 133-157 (1994)
18. Pöschel, R., Kalužnin, L.: Funktionen- und Relationenalgebren. DVW, Berlin (1979)
19. Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier, Amsterdam (2006)
20. Trevisan, L.: Inapproximability of combinatorial optimization problems, arXiv.org:cs.CC/0409043 (2004)