Binarisation for Valued Constraint Satisfaction Problems

David Cohen, Martin Cooper, Peter Jeavons, Andrei Krokhin, Robert Powell, Stanislav Zivny

Research output: Contribution to journalArticlepeer-review

77 Downloads (Pure)


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 Bulín et al. [Log. Methods Comput. Sci., 11 (2015)] to VCSPs. This reduction establishes that VCSPs over a fixed valued constraint language are polynomial-time equivalent to minimum-cost homomorphism problems over a fixed digraph.
Original languageEnglish
Pages (from-to)2279-2300
Number of pages22
JournalSIAM Journal on Discrete Mathematics
Issue number4
Early online date3 Oct 2017
Publication statusE-pub ahead of print - 3 Oct 2017

Cite this