291 search results - page 1 / 59 » Constraint Satisfaction: The Approximability of Minimization... |
COCO
1997
Springer
13 years 9 months ago
1997
Springer
STOC
2009
ACM
14 years 6 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
CSR
2007
Springer
13 years 11 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
CSR
2009
Springer
13 years 6 months ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...