Hybrid Tractable Classes of Constraint Problems

Cooper, Martin C.; Zivny, Stanislav

doi:10.4230/DFU.Vol7.15301.113

Document

Hybrid Tractable Classes of Constraint Problems

Authors Martin C. Cooper, Stanislav Zivny

Part of: Volume: The Constraint Satisfaction Problem: Complexity and Approximability (DFU - Vol. 7)
Part of: Series: Dagstuhl Follow-Ups (DFU)
License: Creative Commons Attribution 3.0 Unported license
Publication Date: 2017-02-21

PDF

File

DFU.Vol7.15301.113.pdf

Filesize: 0.56 MB
23 pages

Document Identifiers

DOI: 10.4230/DFU.Vol7.15301.113
URN: urn:nbn:de:0030-drops-69616

Author Details

Martin C. Cooper

Stanislav Zivny

Cite As Get BibTex

Martin C. Cooper and Stanislav Zivny. Hybrid Tractable Classes of Constraint Problems. In The Constraint Satisfaction Problem: Complexity and Approximability. Dagstuhl Follow-Ups, Volume 7, pp. 113-135, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017) https://doi.org/10.4230/DFU.Vol7.15301.113

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.

Subject Classification

Keywords

Constraint satisfaction problems
Optimisation
Tractability

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail