Hard constraint satisfaction problems have hard gaps at location 1

Theoretical Computer Science

Volumn 410, Issue 38-40, 2009, Pages 3856-3874

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

^a LINKÖPING UNIVERSITY   (Sweden)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Approximability; Computational complexity; Constraint satisfaction; Dichotomy; Optimisation; Universal algebra

Indexed keywords

APPROXIMABILITY; CONSTRAINT SATISFACTION; DICHOTOMY; OPTIMISATION; UNIVERSAL ALGEBRA;

ALGEBRA; COMPUTER OPERATING PROCEDURES; LINGUISTICS; QUERY LANGUAGES; STEELMAKING;

COMPUTATIONAL COMPLEXITY;

EID: 68249090781     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.05.022     Document Type: Article

References (55)

1. Alimonti P., and Kann V. Some APX-completeness results for cubic graphs. Theoret. Comput. Sci. 237 1-2 (2000) 123-134
2. Arora S. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45 5 (1998) 753-782
3. Arora S., and Lund C. Hardness of approximations. In: Hochbaum D. (Ed). Approximation Algorithms for NP-hard Problems (1997), PWS Publishing, Boston, MA, USA 399-446 (Chapter 10)
4. Arora S., Lund C., Motwani R., Sudan M., and Szegedy M. Proof verification and the hardness of approximation problems. J. ACM 45 3 (1998) 501-555
5. Arora S., and Safra S. Probabilistic checking of proofs: A new characterization of NP. J. ACM 45 1 (1998) 70-122
6. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., and Protasi M. Complexity and approximation: Combinatorial Optimization Problems and their Approximability Properties (1999), Springer
7. Barto L., Kozik M., and Niven T. The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell). SIAM J. Comput. 38 5 (2009) 1782-1802
8. Bulatov A. Tractable conservative constraint satisfaction problems. Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science. LICS '03 (2003), IEEE Computer Society, Washington, DC, USA
9. Bulatov A. A dichotomy theorem for constraint satisfaction problems on a 3-element set. J. ACM 53 1 (2006) 66-120
10. Bulatov A., and Dalmau V. A simple algorithm for Mal'tsev constraints. SIAM J. Comput. 36 1 (2006) 16-27
11. A. Bulatov, P. Jeavons, Algebraic structures in combinatorial problems, Tech. Rep. MATH-AL-4-2001, Technische Universität Dresden, 2001
12. Bulatov A., Jeavons P., and Krokhin A. Classifying the complexity of constraints using finite algebras. SIAM J. Comput. 34 3 (2005) 720-742
13. Bulatov A., Krokhin A., and Jeavons P. The complexity of maximal constraint languages. Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing. STOC '01 (2001), ACM Press, New York, NY, USA
14. Burris S., and Sankappanavar H. A Course in Universal Algebra (1981), Springer Verlag, Berlin. http://citeseer.ist.psu.edu/sankappanavar81course.html
15. Charikar M., Makarychev K., and Makarychev Y. Near-optimal algorithms for unique games. Proceedings of the Thirty-eighth Annual ACM Symposium on Theory of Computing. STOC '06 (2006), ACM Press, New York, NY, USA
16. Cohen D., Cooper M., Jeavons P., and Krokhin A. Supermodular functions and the complexity of Max CSP. Discrete Appl. Math. 149 1-3 (2005) 53-72
17. Cohen D., and Jeavons P. The complexity of constraint languages. In: Rossi F., van Beek P., and Walsh T. (Eds). Handbook of Constraint Programming (2006), Elsevier 245-280 (Chapter 8)
18. Cohn P. Universal Algebra. Mathematics and its Applications vol. 6 (1981), Reidel Originally published by Harper and Row, 1965
19. Creignou N. A dichotomy theorem for maximum generalized satisfiability problems. J. Comput. System Sci. 51 3 (1995) 511-522
20. Creignou N., Khanna S., and Sudan M. Complexity Classifications of Boolean Constraint Satisfaction Problems (2001), Society for Industrial and Applied Mathematics, Philadelphia, PA, USA
21. Crescenzi P. A short guide to approximation preserving reductions. Proceedings of the 12th Annual IEEE Conference on Computational Complexity. CCC '97 (1997), IEEE Computer Society, Washington, DC, USA
22. Dalmau V., and Jeavons P. Learnability of quantified formulas. Theoret. Comput. Sci. 306 1-3 (2003) 485-511
23. Deineko V., Jonsson P., Klasson M., and Krokhin A. The approximability of MAX CSP with fixed-value constraints. J. ACM 55 4 (2008) 1-37
24. Dietrich B.L., and Hoffman A.J. On greedy algorithms, partially ordered sets, and submodular functions. IBM J. Res. Dev. 47 1 (2003) 25-30
25. Dinur I. The PCP theorem by gap amplification. J. ACM 54 3 (2007) 12
26. Engebretsen L., Holmerin J., and Russell A. Inapproximability results for equations over finite groups. Theoret. Comput. Sci. 312 1 (2004) 17-45
27. Feder T., Hell P., and Huang J. List homomorphisms of graphs with bounded degrees. Discrete Math. 307 (2007) 386-392
28. Feder T., and Vardi M.Y. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM J. Comput. 28 1 (1998) 57-104
29. Goldmann M., and Russell A. The complexity of solving equations over finite groups. Inform. Comput. 178 1 (2002) 253-262
30. Hell P., and Nešetřil J. Graphs and Homomorphisms (2004), Oxford University Press
31. Håstad J. Some optimal inapproximability results. J. ACM 48 4 (2001) 798-859
32. Ibarra O.H., and Kim C.E. Fast approximation for the knapsack and sum of subset problems. J. ACM 22 4 (1975) 463-468
33. Jeavons P. On the algebraic structure of combinatorial problems. Theoret. Comput. Sci. 200 1-2 (1998) 185-204
34. Jeavons P., Cohen D., and Gyssens M. Closure properties of constraints. J. ACM 44 (1997) 527-548
35. Jonsson P., Klasson M., and Krokhin A. The approximability of three-valued Max CSP. SIAM J. Comput. 35 6 (2006) 1329-1349
36. Jonsson P., and Krokhin A. Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights. J. Comput. System Sci. 73 5 (2007) 691-702
37. Khanna S., Sudan M., Trevisan L., and Williamson D.P. The approximability of constraint satisfaction problems. SIAM J. Comput. 30 6 (2000) 1863-1920
38. Khot S. On the power of unique 2-prover 1-round games. Proceedings of the Thirty-fourth Annual ACM Symposium on Theory of Computing. STOC '02 (2002), ACM Press, New York, NY, USA
39. Khot S., Kindler G., Mossel E., and O'Donnell R. Optimal inapproximability results for Max-Cut and other 2-variable CSPs?. SIAM J. Comput. 37 1 (2007) 319-357
40. Kratochvíl J., Savický P., and Tuza Z. One more occurrence of variables makes satisfiability jump from trivial to NP-complete. SIAM J. Comput. 22 1 (1993) 203-210
41. A. Krokhin, B. Larose, Maximum constraint satisfaction on diamonds, Tech. Rep. CS-RR-408, University of Warwick, UK, 2004
42. Krokhin A., and Larose B. Maximum constraint satisfaction on diamonds. Principles and Practice of Constraint Programming. CP '05 (2005), Springer
43. Ladner R.E. On the structure of polynomial time reducibility. J. ACM 22 1 (1975) 155-171
44. Larose B., and Zádori L. Taylor terms, constraint satisfaction and the complexity of polynomial equations over finite algebras. Internat. J. Algebra Comput. 16 3 (2006) 563-581
45. Lipton R., and Tarjan R. Applications of a planar separator theorem. SIAM J. Comput. 9 (1980) 615-627
46. Lubotzky A., Phillips R., and Sarnak P. Ramanujan graphs. Combinatorica 8 3 (1988) 261-277
47. Maróti M., and McKenzie R. Existence theorems for weakly symmetric operations. Algebra Universalis 59 3 (2008) 463-489
48. Papadimitriou C.H., and Yannakakis M. Optimization, approximation, and complexity classes. J. Comput. System Sci. 43 (1991) 425-440
49. Petrank E. The hardness of approximation: Gap location. Comput. Complexity 4 (1994) 133-157
50. Pöschel R., and Kalužnin L. Funktionen- und Relationenalgebren (1979), DVW, Berlin
51. Raghavendra P. Optimal algorithms and inapproximability results for every CSP?. Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing. STOC '08 (2008), ACM Press, New York, NY
52. In: Rossi F., van Beek P., and Walsh T. (Eds). Handbook of Constraint Programming (2006), Elsevier
53. Schaefer T.J. The complexity of satisfiability problems. Proceedings of the Tenth Annual ACM Symposium on Theory of Computing. STOC '78 (1978), ACM Press, New York, NY, USA
54. Szendrei Á. Clones in Universal Algebra. Séminaire de Mathématiques Supérieures vol. 99 (1986), University of Montreal
55. L. Trevisan, Inapproximability of combinatorial optimization problems, 2004. arXiv.org:cs.CC/0409043