A dichotomy theorem for conservative general-valued CSPs

We study the complexity of valued constraint satisfaction p roblems (VCSP). A problem from VCSP is characterised by a constraint language , a fixed set of cost functions over a finite domain. An instance of the problem is specified by a sum of cost functions from the l anguage and the goal is to minimise the sum. We consider the case of so-called… (More)