Jonsson, P. and Krokhin, A. (2007) 'Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights.', Journal of computer and system sciences., 73 (5). pp. 691-702.
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.
|Keywords:||Maximum constraint satisfaction problem, Digraph H-colouring, Complexity, Dichotomy|
|Full text:||(VoR) Version of Record|
Download PDF (235Kb)
|Publisher Web site:||http://dx.doi.org/10.1016/j.jcss.2007.02.001|
|Record Created:||26 Mar 2010 15:35|
|Last Modified:||14 Dec 2011 09:48|
|Social bookmarking:||Export: EndNote, Zotero | BibTex|
|Look up in GoogleScholar | Find in a UK Library|