Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights

  • Authors:

  • Peter Jonsson;Andrei Krokhin

  • Affiliations:

  • Department of Computer and Information Science, Linköpings Universitet, SE-581 83 Linköping, Sweden;Department of Computer Science, University of Durham, Science Laboratories, South Road, Durham DH1 3LE, UK

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of positive-weight constraints on overlapping sets of variables, and the goal is to assign values from a given domain to the variables so that the total weight of satisfied constraints is maximized. We consider this problem and its variant Max AW CSP where the weights are allowed to be both positive and negative, and study how the complexity of the problems depends on the allowed constraint types. We prove that Max AW CSP over an arbitrary finite domain exhibits a dichotomy: it is either polynomial-time solvable or NP-hard. Our proof builds on two results that may be of independent interest: one is that the problem of finding a maximum H-colourable subdigraph in a given digraph is either NP-hard or trivial depending on H, and the other a dichotomy result for Max CSP with a single allowed constraint type.