Abstract
Tractable classes of binary CSP and binary Max-CSP have recently been discovered by studying classes of instances defined by excluding subproblems. In this paper we characterise the complexity of all classes of binary Max-CSP instances defined by forbidding a single subproblem. In the resulting dichotomy, the only non-trivial tractable class defined by a forbidden subproblem corresponds to the set of instances satisfying the so-called joint-winner property.
Martin Cooper is supported by Projects ANR-10-BLAN-0210 and 0214. Stanislav Živný is supported by a Junior Research Fellowship at University College, Oxford.
This is a preview of subscription content, log in via an institution to check access.
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
Bertelé, U., Brioshi, F.: Nonserial dynamic programming. Academic Press (1972)
Cooper, M.C., Escamocher, G.: A Dichotomy for 2-Constraint Forbidden CSP Patterns. In: AAAI 2012 (2012)
Cooper, M.C., Jeavons, P.G., Salamon, A.Z.: Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination. Artificial Intelligence 174(9-10), 570–584 (2010)
Cooper, M.C., Živný, S.: Tractable Triangles. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 195–209. Springer, Heidelberg (2011)
Cooper, M.C., Živný, S.: Hierarchically Nested Convex VCSP. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 187–194. Springer, Heidelberg (2011)
Cooper, M.C., Živný, S.: Hybrid tractability of valued constraint problems. Artificial Intelligence 175(9-10), 1555–1569 (2011)
Creignou, N., Khanna, S., Sudan, M.: Complexity classification of Boolean constraint satisfaction problems. SIAM Monographs on Discrete Mathematics and Applications, vol. 7 (2001)
Dalmau, V., Kolaitis, P.G., Vardi, M.Y.: Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 310–326. Springer, Heidelberg (2002)
Dechter, R.: Constraint Processing. Morgan Kaufmann (2003)
Deineko, V., Jonsson, P., Klasson, M., Krokhin, A.: The approximability of Max CSP with fixed-value constraints. Journal of the ACM 55(4) (2008)
Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM 54(1), 1–24 (2007)
Jonsson, P., Klasson, M., Krokhin, A.: The approximability of three-valued MAX CSP. SIAM J. Comput. 35(6), 1329–1349 (2006)
Jonsson, P., Kuivinen, F., Thapper, J.: Min CSP on Four Elements: Moving beyond Submodularity. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 438–453. Springer, Heidelberg (2011)
Kamiński, M.: max-cut and Containment Relations in Graphs. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 15–26. Springer, Heidelberg (2010)
Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. Journal of Computer System Sciences 20(2), 219–230 (1980)
Orlin, J.B.: A faster strongly polynomial time algorithm for submodular function minimization. Mathematical Programming Ser. A 118(2), 237–251 (2009)
Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Applied Mathematics 144, 173–182 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cooper, M.C., Escamocher, G., Živný, S. (2012). A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP. In: Milano, M. (eds) Principles and Practice of Constraint Programming. CP 2012. Lecture Notes in Computer Science, vol 7514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33558-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-33558-7_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33557-0
Online ISBN: 978-3-642-33558-7
eBook Packages: Computer ScienceComputer Science (R0)