Binarisation for Valued Constraint Satisfaction Problems
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 29010831
- Type
- D - Journal article
- DOI
-
10.1137/16M1088107
- Title of journal
- SIAM Journal on Discrete Mathematics
- Article number
- -
- First page
- 2279
- Volume
- 31
- Issue
- 4
- ISSN
- 0895-4801
- Open access status
- Compliant
- Month of publication
- October
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
5
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The Valued Constraint Satisfaction Problem (VCSP) is of considerable importance as it captures precisely all optimisation problems defined by summing local costs on subsets of the instance variables. Hence, much work has been done on characterising the complexity of VCSP. Here we make a major breakthrough by showing a reduction to tractable (binary) cases where costs are on pairs of variables: this reduction preserves all algebraic properties and hence has the same solution complexity and effective algorithms. We go further, reducing to binary problems with just one cost function: surprising as it reduces VCSP to the well-studied MinCostHom for digraphs.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -