Binarisation for valued constraint satisfaction problems - Archive ouverte HAL Access content directly
Journal Articles SIAM Journal on Discrete Mathematics Year : 2017

Binarisation for valued constraint satisfaction problems

Abstract

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.
Fichier principal
Vignette du fichier
cohen_19187.pdf (489.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01646073 , version 1 (23-11-2017)

Identifiers

Cite

David A. Cohen, Martin Cooper, Peter G. Jeavons, Andrei Krokhin, Robert Powell, et al.. Binarisation for valued constraint satisfaction problems. SIAM Journal on Discrete Mathematics, 2017, vol. 31 (n° 4), pp. 2279-2300. ⟨10.1137/16M1088107⟩. ⟨hal-01646073⟩
95 View
82 Download

Altmetric

Share

Gmail Facebook X LinkedIn More