Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | The Complexity of Valued Constraint Satisfaction Problems

The Complexity of Valued Constraint Satisfaction Problems

Živný, Stanislav

2012, XVIII, 170 p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$79.99

(net) price for USA

ISBN 978-3-642-33974-5

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$109.00

(net) price for USA

ISBN 978-3-642-33973-8

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$109.00

(net) price for USA

ISBN 978-3-642-43456-3

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • Presents general methods for analysing the complexity of optimisation problems cast as valued constraint satisfaction problems (VCSPs)
  • Suitable for researchers interested in methods and results from the area of constraint programming and discrete optimisation
  • Related thesis received ACP (Association for Constraint Programming) Doctoral Award

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.

Content Level » Research

Keywords » Algorithms - Constraint programming (CP) - Constraint satisfaction problem (CSP) - Discrete optimization - Linear programming (LP) - Tractability - Tractable languages - Valued Constraint satisfaction problems (VCSPs)

Related subjects » Artificial Intelligence - Mathematics - Theoretical Computer Science

Table of contents / Preface / Sample pages 

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

For authors and editors

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Theory of Computation.