Beating a Random Assignment : Approximating Constraint Satisfaction Problems
An instance of a Boolean constraint satisfaction problem, CSP, consists of a set of constraints acting over a set of Boolean variables. The objective is to find an assignment to the variables that satisfies all the constraints. In the maximization version, Max CSP, each constraint has a weight and t...
| Main Author: | |
|---|---|
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
KTH, Numerisk Analys och Datalogi, NADA
2005
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-215 http://nbn-resolving.de/urn:isbn:91-7178-051-3 |