A combinatorial algorithm for max csp
β
Mayur Datar; TomΓ‘s Feder; Aristides Gionis; Rajeev Motwani; Rina Panigrahy
π
Article
π
2003
π
Elsevier Science
π
English
β 128 KB
We consider the problem MAX CSP over multi-valued domains with variables ranging over sets of size s i s and constraints involving k j k variables. We study two algorithms with approximation ratios A and B, respectively, so we obtain a solution with approximation ratio max(A, B). The first algorith