The Complexity of Valued Constraint Models

The VALUED CONSTRAINT SATISFACTION PROBLEM (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in the 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 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 VCSP framework, in contrast to the CSP framework.

[1]  Thomas Schiex,et al.  Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison , 1999, Constraints.

[2]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[3]  Alexander Schrijver,et al.  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.

[4]  James B. Orlin,et al.  A faster strongly polynomial time algorithm for submodular function minimization , 2007, Math. Program..

[5]  Maurice Queyranne,et al.  Minimizing symmetric submodular functions , 1998, Math. Program..

[6]  Mechthild Stoer,et al.  A simple min-cut algorithm , 1997, JACM.

[7]  Sanjeev Khanna,et al.  Complexity classifications of Boolean constraint satisfaction problems , 2001, SIAM monographs on discrete mathematics and applications.

[8]  Satoru Iwata,et al.  A simple combinatorial algorithm for submodular function minimization , 2009, SODA.

[9]  Peter Jeavons,et al.  Classifying the Complexity of Constraints Using Finite Algebras , 2005, SIAM J. Comput..

[10]  Sanjeev Khanna,et al.  3. Boolean Constraint Satisfaction Problems , 2001 .

[11]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[12]  Martin C. Cooper,et al.  The complexity of soft constraint satisfaction , 2006, Artif. Intell..

[13]  Satoru Iwata,et al.  A fully combinatorial algorithm for submodular function minimization , 2001, SODA '02.

[14]  H. Narayanan,et al.  A note on the minimization of symmetric and general submodular functions , 2003, Discret. Appl. Math..

[15]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[16]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

[17]  Endre Boros,et al.  Pseudo-Boolean optimization , 2002, Discret. Appl. Math..