Every 2-csp Allows Nontrivial Approximation.

Published in: Comput. Complex. (2008)

Keyphrases

constraint satisfaction problems
constraint satisfaction
np complete
decomposition methods
data sets
closed form
constraint programming
error bounds
arc consistency
approximation methods
tree decomposition
search algorithm
upper bound
worst case
relative error