On the efficient approximability of constraint satisfaction problems
2007 (English)In: London Mathematical Society lecture note series, Vol. 346, 201-222 p.Article in journal (Refereed) Published
We discuss some results about the efficient approximability of constraint satisfaction problems. in particular we focus on the question on an efficient algorithm can perform significantly better than the algorithm that picks a solution uniformly at random.
Place, publisher, year, edition, pages
2007. Vol. 346, 201-222 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-62994OAI: oai:DiVA.org:kth-62994DiVA: diva2:481474
Surveys in combinatorics 2007. QC 201201232012-01-212012-01-212012-01-23Bibliographically approved