Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/DFU.Vol7.15301.113
URN: urn:nbn:de:0030-drops-69616
URL: https://drops.dagstuhl.de/opus/volltexte/2017/6961/
Cooper, Martin C. ; Zivny, Stanislav
Hybrid Tractable Classes of Constraint Problems
| pdf-format: |
|
Abstract
We present a survey of complexity results for hybrid constraint satisfaction problems (CSPs) and valued constraint satisfaction problems (VCSPs). These are classes of (V)CSPs defined by restrictions that are not exclusively language-based or structure-based.
BibTeX - Entry
@InCollection{cooper_et_al:DFU:2017:6961,
author = {Martin C. Cooper and Stanislav Zivny},
title = {{Hybrid Tractable Classes of Constraint Problems}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {113--135},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Andrei Krokhin and Stanislav Zivny},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/6961},
URN = {urn:nbn:de:0030-drops-69616},
doi = {10.4230/DFU.Vol7.15301.113},
annote = {Keywords: Constraint satisfaction problems, Optimisation, Tractability}
}
| Keywords: | Constraint satisfaction problems, Optimisation, Tractability | |
| Seminar: | The Constraint Satisfaction Problem: Complexity and Approximability | |
| Issue date: | 2017 | |
| Date of publication: | 21.02.2017 |
