The Complexity of Valued CSPs
Andrei Krokhin, Stanislav Živný · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2017
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.