Corpus ID: 14166846

The complexity of conservative finite-valued CSPs

@article{Kolmogorov2010TheCO,
  title={The complexity of conservative finite-valued CSPs},
  author={V. Kolmogorov and Stanislav Zivn{\'y}},
  journal={ArXiv},
  year={2010},
  volume={abs/1008.1555}
}
We study the complexity of valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a \emph{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 language and the goal is to minimise the sum. We consider the case of so-called \emph{conservative} languages; that is, languages containing all unary cost functions, thus allowing arbitrary restrictions on the domains of the… Expand
7 Citations
A dichotomy theorem for conservative general-valued CSPs
  • 3
  • PDF
Min CSP on Four Elements: Moving beyond Submodularity
  • 33
  • PDF
An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection
  • 24
  • PDF
The Dichotomy for Conservative Constraint Satisfaction Problems Revisited
  • L. Barto
  • Mathematics, Computer Science
  • 2011 IEEE 26th Annual Symposium on Logic in Computer Science
  • 2011
  • 74
  • PDF
On Minimal Weighted Clones
  • 14
Submodularity on a Tree: Unifying $L^\natural$ -Convex and Bisubmodular Functions
  • 24
  • PDF

References

SHOWING 1-10 OF 42 REFERENCES
An Algebraic Characterisation of Complexity for Valued Constraint
  • 51
  • PDF
The approximability of MAX CSP with fixed-value constraints
  • 39
  • PDF
The Approximability of Constraint Satisfaction Problems
  • 202
  • PDF
A Dichotomy Theorem for Maximum Generalized Satisfiability Problems
  • N. Creignou
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1995
  • 137
Tractable conservative constraint satisfaction problems
  • A. Bulatov
  • Mathematics, Computer Science
  • 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
  • 2003
  • 250
The complexity of soft constraint satisfaction
  • 136
  • Highly Influential
  • PDF
A dichotomy theorem for constraint satisfaction problems on a 3-element set
  • 316
Dichotomy theorem for general Minimum Cost Homomorphisms Problem
  • 4
Classifying the Complexity of Constraints Using Finite Algebras
  • 552
  • PDF
...
1
2
3
4
5
...