The Complexity of Valued Constraint Satisfaction Problems

By Stanislav Živný

  • eBook Price: $79.99
Buy eBook Buy Print Book Add to Wishlist

The Complexity of Valued Constraint Satisfaction Problems Cover Image

This book presents general methods for analysing the complexity of optimisation problems cast as valued constraint satisfaction problems (VCSPs). It is an ideal resource for researchers in constraint programming and discrete optimisation.

Full Description

  • ISBN13: 978-3-6423-3973-8
  • 188 Pages
  • User Level: Science
  • Publication Date: October 19, 2012
  • Available eBook Formats: PDF

Related Titles

Full Description
The topic of this book is the following optimisation problem: given a set of discrete variables and a set of functions, each depending on a subset of the variables, minimise the sum of the functions over all variables. This fundamental research problem has been studied within several different contexts of discrete mathematics, computer science and artificial intelligence under different names: Min-Sum problems, MAP inference in Markov random fields (MRFs) and conditional random fields (CRFs), Gibbs energy minimisation, valued constraint satisfaction problems (VCSPs), and, for two-state variables, pseudo-Boolean optimisation.In this book the author presents general techniques for analysing the structure of such functions and the computational complexity of the minimisation problem, and he gives a comprehensive list of tractable cases. Moreover, he demonstrates that the so-called algebraic approach to VCSPs can be used not only for the search for tractable VCSPs, but also for other questions such as finding the boundaries to the applicability of certain algorithmic techniques.The book is suitable for researchers interested in methods and results from the area of constraint programming and discrete optimisation.
Table of Contents

Table of Contents

  1. Chap. 1 Introduction.
  2. Chap. 2 Background.
  3. Chap. 3 Expressibility of Valued Constraints.
  4. Chap. 4 Expressibility of Fixed
  5. Arity Languages.
  6. Chap. 5 Expressibility of Submodular Languages.
  7. Chap. 6 Non
  8. expressibility of Submodular Languages.
  9. Chap. 7 Tractable Languages.
  10. Chap. 8  Conservative Languages.
  11. Chap. 9 The Power of Linear Programming.
  12. Chap. 10 Hybrid Tractability.
  13. Chap. 11 Summary and Open Problems.
  14. References.
  15. Index.

Please Login to submit errata.

No errata are currently published