Exploiting Structure in CSP-related Problems
In this thesis we investigate the computational complexity and approximability of computational problems from the constraint satisfaction framework. An instance of a constraint satisfaction problem (CSP) has three components; a set V of variables, a set D of domain values, and a set of constraints C...
| Main Author: | |
|---|---|
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
Linköpings universitet, Programvara och system
2013
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-85668 http://nbn-resolving.de/urn:isbn:978-91-7519-711-1 |