The Complexity of Valued CSPs

Authors Andrei Krokhin, Stanislav Zivny



PDF
Thumbnail PDF

File

DFU.Vol7.15301.233.pdf
  • Filesize: 0.72 MB
  • 34 pages

Document Identifiers

Author Details

Andrei Krokhin
Stanislav Zivny

Cite As Get BibTex

Andrei Krokhin and Stanislav Zivny. The Complexity of Valued CSPs. In The Constraint Satisfaction Problem: Complexity and Approximability. Dagstuhl Follow-Ups, Volume 7, pp. 233-266, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017) https://doi.org/10.4230/DFU.Vol7.15301.233

Abstract

We survey recent results on the broad family of problems that can be cast as valued constraint satisfaction problems (VCSPs). We discuss general methods for analysing the complexity of such problems, give examples of tractable cases, and identify general features of the complexity landscape.

Subject Classification

Keywords
  • Constraint satisfaction problems
  • Optimisation
  • Tractability

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail