• Media type: Text; E-Article
  • Title: The Complexity of Valued CSPs
  • Contributor: Krokhin, Andrei [Author]; Zivny, Stanislav [Author]
  • imprint: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
  • Language: English
  • DOI: https://doi.org/10.4230/DFU.Vol7.15301.233
  • Keywords: Constraint satisfaction problems ; Optimisation ; Tractability
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: 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.
  • Access State: Open Access