Work

The Complexity of Valued Constraint Satisfaction

Year: 2014

Type: article

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

Source: Durham Research Online (Durham University)

Authors: Peter Jeavons, Andrei Krokhin, Stanislav Živný

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Engineering and Physical Sciences Research Council

Award: Submodular optimization, lattice theory and maximum constraint satisfaction problems

OpenAlex ID: W1945412132

FWCI: 6.072

Cites: 87

Cited by: 27

Related to: 9