Supermodular functions and the complexity of MAX CSP

@article{Cohen2005SupermodularFA,
  title={Supermodular functions and the complexity of MAX CSP},
  author={David A. Cohen and Martin C. Cooper and Peter Jeavons and Andrei A. Krokhin},
  journal={Discrete Applied Mathematics},
  year={2005},
  volume={149},
  pages={53-72}
}
In this paper we study the complexity of the maximum constraint satisfaction problem (Max CSP) over an arbitrary finite domain. An instance of Max CSP consists of a set of variables and a collection of constraints which are applied to certain specified subsets of these variables; the goal is to find values for the variables which maximize the number of simultaneously satisfied constraints. Using the theory of suband supermodular functions on finite lattice-ordered sets, we obtain the first… CONTINUE READING
Highly Cited
This paper has 52 citations. REVIEW CITATIONS

2 Figures & Tables

Topics

Statistics

051015'05'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

52 Citations

Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.