Binarisation for Valued Constraint Satisfaction Problems

@article{Cohen2016BinarisationFV,
  title={Binarisation for Valued Constraint Satisfaction Problems},
  author={David A. Cohen and Martin C. Cooper and Peter Jeavons and Andrei A. Krokhin and Robert Powell and Stanislav Živn{\'y}},
  journal={ArXiv},
  year={2016},
  volume={abs/1608.01628}
}
We study methods for transforming valued constraint satisfaction problems (VCSPs) to binary VCSPs. First, we show that the standard dual encoding preserves many aspects of the algebraic properties that capture the computational complexity of VCSPs. Second, we extend the reduction of CSPs to binary CSPs described by Bulin et al. [LMCS'15] to VCSPs. This reduction establishes that VCSPs over a fixed valued constraint language are polynomial-time equivalent to Minimum-Cost Homomorphism Problems… 

Figures from this paper

The Complexity of Valued CSPs

We survey recent results on the broad family of problems that can be cast as valued constraint satisfaction problems (VCSPs). We discuss general methods for analysing the complexity of such problems,

The Power of Sherali-Adams Relaxations for General-Valued CSPs

A precise algebraic characterization of the power of Sherali--Adams relaxations for solvability of valued constraint satisfaction problems (CSPs) to optimality is given and a dichotomy theorem for valued constraint languages that can express an injective unary function is obtained.

An Efficient Local Search algorithm for Over-Constrained CSPs

  • Jufang LiYan Chi
  • Computer Science
    IOP Conference Series: Earth and Environmental Science
  • 2019
VCSP can hardly be resolved by the classical constraint satisfying techniques, and this paper provides an application of the Guided Local Search in solving VCSPs.

Galois Connections for Patterns: An Algebra of Labelled Graphs

This work presents a Galois connection between lattices composed of sets of forbidden patterns and sets of generic instances, and investigates the power of forbidding augmented patterns and discusses their potential for describing new tractable classes.

91 : 2 Toward a Dichotomy for Approximation of H-Coloring 1

Given two (di)graphs G, H and a cost function c : V (G)×V (H)→ Q≥0∪{+∞}, in the minimum cost homomorphism problem, MinHOM(H), we are interested in finding a homomorphism f : V (G)→ V (H) (a.k.a

Toward a Dichotomy for Approximation of $H$-coloring

Given two (di)graphs G, H and a cost function $c:V(G)\times V(H) \to \mathbb{Q}_{\geq 0}\cup\{+\infty\}$, in the minimum cost homomorphism problem, MinHOM(H), goal is finding a homomorphism

References

SHOWING 1-10 OF 76 REFERENCES

The Complexity of Valued CSPs

We survey recent results on the broad family of problems that can be cast as valued constraint satisfaction problems (VCSPs). We discuss general methods for analysing the complexity of such problems,

The complexity of conservative valued CSPs

A Schaefer-like dichotomy theorem is proved for conservative valued languages: if all cost functions in the language satisfy a certain condition, then any instance can be solved in polynomial time, otherwise the language is NP-hard.

A finer reduction of constraint problems to digraphs

The Algebraic CSP dichotomy conjecture as well as the conjectures characterizing CSPs solvable in logspace and in nondeterministic logspace are equivalent to their restriction to digraphs.

A Reduction from Valued CSP to Min Cost Homomorphism Problem for Digraphs

This paper adapts a recent proof to the more general setting of VCSP to show that each VCSP with a fixed finite (valued) constraint language is equivalent to one where the constraint language contains a single binary relation (i.e. a digraph) and one finite-valued unary function.

Sherali-Adams Relaxations for Valued CSPs

Almost all of the known tractable languages with arbitrary weighted relations have an integrality gap 1 for the Sherali-Adams relaxation with parameters, which is closely connected to the notion of bounded relational width for the ordinary constraint satisfaction problem and its recent characterisation.

On the Dual Representation of Non-binary Semiring-based CSPs

This paper observes that any non-binary soft constraint CSP can be reformulated as a problem with only binary and unary constraints, and shows that the same translation methods can be applied in the soft constraints framework.

Skew Bisubmodularity and Valued CSPs

It is proved that submodularity with respect to a total order and skew bisubmodularity give rise to the only tractable cases, and, in all other cases, again, Max Cut can be expressed.

Complexity classifications for the valued constraint satisfaction problem

The results provide a new dichotomy theorem in constraint satisfaction research, which proves that 1-defect chain multimorphisms, which are required in the four element dichotomy of Min CSP, are a special case of more general fractional polymorphisms the authors call {a,b}.

The Complexity of General-Valued CSPs

It is proved that if a constraint language satisfies this algebraic necessary condition for tractability of a general-valued CSP with a fixed constraint language, then the VCSP is tractable.

The Power of Sherali-Adams Relaxations for General-Valued CSPs

A precise algebraic characterization of the power of Sherali--Adams relaxations for solvability of valued constraint satisfaction problems (CSPs) to optimality is given and a dichotomy theorem for valued constraint languages that can express an injective unary function is obtained.
...