Abstract
The Valued Constraint Satisfaction Problem (\({\textsc{VCSP}}\)) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in the \({\textsc{VCSP}}\) framework. Using our analysis, we show that some optimisation problems, such as (s,t)-Min-Cut and Submodular Function Minimisation, can be modelled using a restricted set of valued constraints which are tractable to solve regardless of how they are combined. Hence, these problems can be viewed as special cases of more general problems which include all possible instances using the same forms of valued constraint. However, other, apparently similar, problems such as Min-Cut and Symmetric Submodular Function Minimisation, which also have polynomial-time algorithms, can only be naturally modelled in the \({\textsc{VCSP}}\) framework by using valued constraints which can represent NP-complete problems. This suggests that the reason for tractability in these problems is more subtle; it relies not only on the form of the valued constraints, but also on the precise structure of the problem. Furthermore, our results suggest that allowing constant constraints can significantly alter the complexity of problems in the \({\textsc{VCSP}}\) framework, in contrast to the \({\textsc{CSP}}\) framework.
Stanislav Živný is supported by EPSRC grant EP/F01161X/1.
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
Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G.: Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison. Constraints 4, 199–240 (1999)
Boros, E., Hammer, P.L.: Pseudo-boolean optimization. Discrete Applied Mathematics 123(1-3), 155–225 (2002)
Bulatov, A., Krokhin, A., Jeavons, P.: Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34(3), 720–742 (2005)
Cohen, D., Cooper, M., Jeavons, P., Krokhin, A.: The complexity of soft constraint satisfaction. Artificial Intelligence 170, 983–1016 (2006)
Creignou, N., Khanna, S., Sudan, M.: Complexity Classification of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications, vol. 7. SIAM, Philadelphia (2001)
Goldberg, A., Tarjan, R.: A new approach to the maximum flow problem. Journal of the ACM 35, 921–940 (1988)
Iwata, S., Orlin, J.B.: A Simple Combinatorial Algorithm for Submodular Function Minimization. In: Proceedings of the 20th SODA, pp. 1230–1237 (2009)
Narayanan, H.: A note on the minimization of symmetric and general submodular functions. Discrete Applied Mathematics 131(2), 513–522 (2003)
Orlin, J.B.: A faster strongly polynomial time algorithm for submodular function minimization. Mathematical Programming 118, 237–251 (2009)
Queyranne, M.: Minimising symmetric submodular functions. Mathematical Programming 82, 3–12 (1998)
Rossi, F., van Beek, P., Walsh, T. (eds.): The Handbook of Constraint Programming. Elsevier, Amsterdam (2006)
Schiex, T., Fargier, H., Verfaillie, G.: Valued constraint satisfaction problems: hard and easy problems. In: Proceedings of the 14th IJCAI, Montreal, Canada (1995)
Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. of Combinatorial Theory, Series B 80, 346–355 (2000)
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics, vol. 24. Springer, Heidelberg (2003)
Smith, B.: Modelling. In: The Handbook of Constraint Programming, ch. 11. Elsevier, Amsterdam (2006)
Stoer, M., Wagner, F.: A simple min-cut algorithm. Journal of the ACM 44(4), 585–591 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Živný, S., Jeavons, P.G. (2009). The Complexity of Valued Constraint Models. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_64
Download citation
DOI: https://doi.org/10.1007/978-3-642-04244-7_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04243-0
Online ISBN: 978-3-642-04244-7
eBook Packages: Computer ScienceComputer Science (R0)