# Identifying Efficiently Solvable Cases of Max CSP

@inproceedings{Cohen2004IdentifyingES,
title={Identifying Efficiently Solvable Cases of Max CSP},
author={David A. Cohen and Martin C. Cooper and Peter Jeavons and Andrei A. Krokhin},
booktitle={STACS},
year={2004}
}
• Published in STACS 25 March 2004
• Mathematics, Computer Science
In this paper we study the complexity of the maximum constraint satisfaction problem (Max CSP) over an arbitrary finite domain. We describe a novel connection between this problem and the supermodular function maximization problem (which is dual to the submodular function minimization problem). Using this connection, we are able to identify large classes of efficiently solvable subproblems of Max CSP arising from certain restrictions on the constraint types. Until now, the only known polynomial…
9 Citations
The Approximability of Three-valued MAX CSP
• Computer Science, Mathematics
SIAM J. Comput.
• 2006
This paper establishes the first step in this direction by establishing this result for MAX CSP over a three-element domain and presents a simple description of all polynomial-time solvable cases of the problem, which uses the well-known algebraic combinatorial property of supermodularity.
Supermodularity on chains and complexity of maximum constraint satisfaction problems
• Mathematics, Computer Science
• 2005
Any maximum constraint satisfaction problem with a finite set of allowed constraint types, which includes all constants, is either solvable in polynomial time or is $\mathrm{NP}$-complete.
Maximum Constraint Satisfaction on Diamonds
• Computer Science
CP
• 2005
This paper studies the complexity of the weighted maximum constraint satisfaction problem over an arbitrary finite domain and proves several results confirming this in a special case when the lattice ordering is as loose as possible, i.e., a diamond one.
Constraint satisfaction with infinite domains
Omega-categoricity is a rather strong model-theoretic assumption on a relational structure, and it can be used to show that many techniques for constraint satisfaction with finite templates extend to omega- categorical templates.
A Linear Programming Approach to Max-Sum Problem: A Review
• Tomáš Werner
• Computer Science
IEEE Transactions on Pattern Analysis and Machine Intelligence
• 2007
This work reviews a not widely known approach to the max-sum labeling problem, developed by Ukrainian researchers Schlesinger et al. in 1976, and shows how it contributes to recent results, most importantly, those on the convex combination of trees and tree-reweighted max-product.
Final Report on GR/R29598/01 Algebraic Structural Methods and Complexity of Constraint Satisfaction
This grant was designed to enable Jeavons, Bulatov and Krokhin to develop a promising new research programme concerning the use of algebraic methods in the analysis of constraint satisfaction problems, and has firmly established this field as an exciting and productive area of research on the boundary between computer science and mathematics.
Handbook of Constraint Programming
• Biology
Handbook of Constraint Programming
• 2006
Soft constraint processing
This (not so) short text presents some results I’m aware of in the field of soft constraint network processing and introduces fundamental operations on soft constraints and shows how these fundamental operations can be used to process and solve soft constraint networks.
Poly-controlled partial evaluation and its application to resource-aware program specialization = evaluacion parcial poicontrolada y su aplicacion a la especializacion de programas consiciente de los recursos
La Evaluacion Parcial es una tecnica automatica para la optimizacion de programas. Su objetivo principal es el de especializar un programa con respecto a parte de sus datos de entrada, los que se

## References

SHOWING 1-10 OF 30 REFERENCES
Tractable conservative constraint satisfaction problems
• A. Bulatov
• Computer Science
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
• 2003
This work completely characterize conservative constraint languages that give rise to CSP classes solvable in polynomial time, and obtains a complete description of those (directed) graphs H for which the List H-Coloring problem is poynomial time solvable.
A dichotomy theorem for constraints on a three-element set
• A. Bulatov
• Computer Science
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
• 2002
Every subclass of the CSP defined by a set of allowed constraints is either tractable or NP-complete, and the criterion separating them is that conjectured by Bulatov et al. (2001).
Quantified Constraints: Algorithms and Complexity
• Mathematics
CSL
• 2003
This paper considers a more general framework for constraint satisfaction problems which allows arbitrary quantifiers over constrained variables, rather than just existential quantifiers, and shows that the complexity of such extended problems is determined by the surjective polymorphisms of the constraint predicates.
A combinatorial algorithm for MAX CSP
• Computer Science, Mathematics
Inf. Process. Lett.
• 2003
Is Constraint Satisfaction Over Two Variables Always Easy?
• Computer Science
RANDOM
• 2002
By the breakthrough work of Hastad, several constraint satisfaction problems are now known to have the following approximation resistance property: satisfying more clauses than what picking a random
The complexity of satisfiability problems
An infinite class of satisfiability problems is considered which contains these two particular problems as special cases, and it is shown that every member of this class is either polynomial-time decidable or NP-complete.
Minimizing submodular functions over families of sets
• Mathematics
Comb.
• 1995
It is derived that the second smallest value of a submodular function over a lattice family can be computed in polynomial-time and generalize and unify several known results.
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Mathematics
SIAM J. Comput.
• 1998
This paper isolates a class (of problems specified by) "monotone monadic SNP without inequality" which may exhibit a dichotomy, and explains the placing of all these restrictions by showing, essentially using Ladner's theorem, that classes obtained by using only two of the above three restrictions do not show this dichotomy.