An LP-designed algorithm for constraint satisfaction
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we present an (O) over tilde (r(19m/100))-time algorithm. It is the fastest algorithm for most problems in the class (including M...
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | Conference item |
| Publicerad: |
2006
|