HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Supermodularity on chains and complexity of maximum constraint satisfaction

Abstract : In the maximum constraint satisfaction problem ($\mathrm{Max \; CSP}$), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given finite domain to the variables so as to maximise the number (or the total weight) of satisfied constraints. This problem is $\mathrm{NP}$-hard in general so it is natural to study how restricting the allowed types of constraints affects the complexity of the problem. In this paper, we show that any $\mathrm{Max \; CSP}$ problem with a finite set of allowed constraint types, which includes all constants (i.e. constraints of the form $x=a$), is either solvable in polynomial time or is $\mathrm{NP}$-complete. Moreover, we present a simple description of all polynomial-time solvable cases of our problem. This description uses the well-known combinatorial property of supermodularity.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Friday, August 14, 2015 - 11:38:25 AM
Last modification on : Tuesday, September 28, 2021 - 2:48:04 PM
Long-term archiving on: : Sunday, November 15, 2015 - 11:03:41 AM


Publisher files allowed on an open archive




Vladimir Deineko, Peter Jonsson, Mikael Klasson, Andrei Krokhin. Supermodularity on chains and complexity of maximum constraint satisfaction. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.51-56, ⟨10.46298/dmtcs.3420⟩. ⟨hal-01184377⟩



Record views


Files downloads