Binarisation for valued constraint satisfaction problems
- Submitting institution
-
University of Oxford
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1998
- 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
- This paper extends a conference version from AAAI 2015. The current paper establishes the result that all discrete optimisation problems that can be formulated over a fixed valued constraint language of any arity (including MAX-SAT, MAX-CUT, and Markov Random Fields) are polynomial-time equivalent to minimum-cost homomorphism problems over a fixed digraph. This result can simplify the complexity classification for all valued constraint languages completed by Kolmogorov, Krokhin, and Rol�nek in SICOMP 2017 (https://doi.org/10.1137/16M1091836).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -