Constraint Satisfaction Problems, and Relaxing Them Semidefinitely

Bernd Gärtner () and Jiří Matoušek ()
Additional contact information
Bernd Gärtner: ETH Zurich, Institute of Theoretical Computer Science
Jiří Matoušek: Charles University, Department of Applied Mathematics

Chapter Chapter 12 in Approximation Algorithms and Semidefinite Programming, 2012, pp 193-210 from Springer

Abstract: Abstract Constraint satisfaction problems constitute an important and much studied class of computational problems. We will discuss them from the point of view of SDP-based approximation algorithms. They are also investigated from other angles, each of them giving rise to a major field of research. We will mention some of these other aspects only very briefly and omit others completely.

Keywords: Approximation Ratio; Constraint Satisfaction Problem; Integral Solution; Conjunctive Normal Form; Input Instance (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-22015-9_12

Ordering information: This item can be ordered from
http://www.springer.com/9783642220159

DOI: 10.1007/978-3-642-22015-9_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().