The complexity of conservative valued CSPs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 750-759

  Kolmogorov, Vladimir ^a   Živný, Stanislav ^b  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMABILITY; BOOLEAN DOMAIN; COMPUTER ASSISTED; CONSTRAINT LANGUAGE; DICHOTOMY THEOREM; FINITE DOMAINS; GENERALISATION; MAX-CSP; NP-HARD; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; SUBMODULAR; UNIQUE GAMES CONJECTURE; VALUED CONSTRAINT SATISFACTION PROBLEMS;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; POLYNOMIAL APPROXIMATION;

COST FUNCTIONS;

EID: 84860165953     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (46)

1. K.A. Baker and A.F. Pixley. Polynomial Interpolation and the Chinese Remainder Theorem. Mathematische Zeitschrift, 143(2):165-174, 1975.
2. L. Barto, M. Kozik, M. Maróti, and T. Niven. CSP dichotomy for special triads. Proceedings of the American Mathematical Society, 137(9):2921-2934, 2009.
3. L. Barto, M. Kozik, and T. Niven. The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell). SIAM Journal on Computing, 38(5):1782-1802, 2009.
4. Libor Barto. The dichotomy for conservative constraint satisfaction problems revisited. In Proceedings of the 26th IEEE Symposium on Logic in Computer Science (LICS'11), pages 301-310, 2011.
5. Libor Barto and Marcin Kozik. Constraint Satisfaction Problems of Bounded Width. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS'09), pages 461-471, 2009.
6. Libor Barto and Marcin Kozik. New Conditions for Taylor Varieties and CSP. In Proceedings of the 25th IEEE Symposium on Logic in Computer Science (LICS'10), pages 100-109, 2010.
7. J. Berman, P. Idziak, P. Marković, R. McKenzie, M. Valeriote, and R. Willard. Varieties with few subalgebras of powers. Transactions of the American Mathematical Society, 362(3):1445-1473, 2010.
8. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Satisfaction and Optimisation. Journal of the ACM, 44(2):201-236, 1997.
9. Andrei Bulatov. A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the ACM, 53(1):66-120, 2006.
10. Andrei Bulatov, Andrei Krokhin, and Peter Jeavons. Classifying the Complexity of Constraints using Finite Algebras. SIAM Journal on Computing, 34(3):720-742, 2005.
11. Andrei A. Bulatov. Tractable Conservative Constraint Satisfaction Problems. In Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS'03), pages 321-330, 2003.
12. R.E. Burkard, B. Klinz, and R. Rudolf. Perspectives of Monge Properties in Optimization. Discrete Applied Mathematics, 70(2):95-161, 1996. (Pubitemid 126401071)
13. D. A. Cohen, M. C. Cooper, and P. G. Jeavons. Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms. Theoretical Computer Science, 401(1-3):36-51, 2008.
14. D. A. Cohen, M. C. Cooper, P. G. Jeavons, and A. A. Krokhin. The Complexity of Soft Constraint Satisfaction. Artificial Intelligence, 170(11):983-1016, 2006.
15. M.C. Cooper. An Optimal k-consistency Algorithm. Artificial Intelligence, 41(1):89-95, 1989.
16. M.C. Cooper. Personal communication. 2011.
17. N. Creignou. A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computer and System Sciences, 51(3):511-522, 1995.
18. N. Creignou, S. Khanna, and M. Sudan. Complexity Classification of Boolean Constraint Satisfaction Problems, volume 7 of SIAM Monographs on Discrete Mathematics and Applications. SIAM, 2001.
19. Víctor Dalmau, Phokion G. Kolaitis, and Moshe Y. Vardi. Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. In Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming (CP'02), volume 2470 of Lecture Notes in Computer Science, pages 310-326. Springer, 2002.
20. R. Dechter. Constraint Processing. Morgan Kaufmann, 2003.
21. R. Dechter and J. Pearl. Network-based Heuristics for Constraint Satisfaction Problems. Artificial Intelligence, 34(1):1-38, 1988.
22. Vladimir Deineko, Peter Jonsson, Mikael Klasson, and Andrei Krokhin. The approximability of Max CSP with fixed-value constraints. Journal of the ACM, 55(4), 2008.
23. T. Feder and M.Y. Vardi. The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory. SIAM Journal on Computing, 28(1):57-104, 1998. (Pubitemid 128491791)
24. M. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
25. Martin Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM, 54(1):1-24, 2007.
26. Martin Grohe and Dániel Marx. Constraint solving via fractional edge covers. In Proceedings of the 17th Annual ACM-SlAM Symposium on Discrete Algorithms (SODA'06), pages 289-298, 2006.
27. Pavol Hell and Jaroslav Nešetřil. Colouring, constraint satisfaction, and complexity. Computer Science Review, 2(3):143-163, 2008.
28. P. Jeavons, D. Cohen, and M. C. Cooper. Constraints, Consistency and Closure. Artificial Intelligence, 101(1-2):251-265, 1998. (Pubitemid 128387395)
29. P.G. Jeavons. On the Algebraic Structure of Combinatorial Problems. Theoretical Computer Science, 200(1-2):185-204, 1998.
30. P.G. Jeavons, D.A. Cohen, and M. Gyssens. Closure Properties of Constraints. Journal of the ACM, 44(4):527-548, 1997. (Pubitemid 127617702)
31. Peter Jonsson, Fredrik Kuivinen, and Johan Thapper. Min CSP on four elements: Moving beyond submodularity. In Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP'11), volume 6876 of Lecture Notes in Computer Science, pages 438-453. Springer, 2011.
32. S. Khanna, M. Sudan, L. Trevisan, and D. Williamson. The approximability of constraint satisfaction problems. SIAM Journal on Computing, 30(6): 1863-1920, 2001. (Pubitemid 34125441)
33. Ph.G. Kolaitis and M.Y. Vardi. Conjunctive-Query Containment and Constraint Satisfaction. Journal of Computer and System Sciences, 61(2):302-332, 2000.
34. Gabor Kun and Mario Szegedy. A New Line of Attack on the Dichotomy Conjecture. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC'09), pages 725-734, 2009.
35. Steffen L. Lauritzen. Graphical Models. Oxford University Press, 1996.
36. Dániel Marx. Approximating fractional hypertree width. ACM Transactions on Algorithms, 6(2), Article 29, 2010.
37. Dániel Marx. Tractable hypergraph properties for constraint satisfaction and conjunctive queries. In Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC'10), pages 735-744, 2010.
38. Christos H. Papadimitriou and Mihalis Yannakakis. Optimization, Approximation, and Complexity Classes. Journal of Computer and System Sciences, 43(3):425-440, 1991.
39. Prasad Raghavendra. Optimal algorithms and inapproximability results for every CSP? In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC'08), pages 245-254, 2008.
40. Prasad Raghavendra and David Steurer. How to Round Any CSP. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS'09), pages 586-594, 2009.
41. T.J. Schaefer. The Complexity of Satisfiability Problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC'78), pages 216-226, 1978.
42. T. Schiex, H. Fargier, and G. Verfaillie. Valued Constraint Satisfaction Problems: Hard and Easy Problems. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI'95), 1995.
43. Rustem Takhanov. A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem. In Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS'10), pages 657-668, 2010.
44. Rustem Takhanov. Extensions of the Minimum Cost Homomorphism Problem. In Proceedings of the 16th International Computing and Combinatorics Conference (COCOON'10), pages 328-337, 2010.
45. D. Topkis. Supermodularity and Complementarity. Princeton University Press, 1998.
46. Martin J. Wainwright and Michael I. Jordan. Graphical models, exponential families, and variational inference. Foundations and Trends in Machine Learning, 1(1-2):1-305, 2008.