论文信息 - Approximation Algorithm for the Max k-CSP Problem

Approximation Algorithm for the Max k-CSP Problem

We present a ck 2 approximation algorithm for the Max k-CSP problem (where c > 0.44 is an absolute constant). This result improves the previously best known algorithm by Hast, which has an approximation guarantee of Ω( k 2 log k ). Our approximation guarantee matches the upper bound of Samorodnitsky and Trevisan up to a constant factor (their result assumes the Unique Games Conjecture).

Moses Charikar | Konstantin Makarychev | Yury Makarychev

[1] Luca Trevisan,et al. Gowers uniformity, influence of variables, and PCPs , 2005, STOC '06.

[2] Y. Nesterov. Quality of semidefinite relaxation for nonconvex quadratic optimization , 1997 .

[3] Subhash Khot. On the power of unique 2-prover 1-round games , 2002, STOC '02.

[4] Gustav Hast,et al. Beating a Random Assignment , 2005, APPROX-RANDOM.

[5] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[6] Gustav Hast. Approximating - Outperforming a Random Assignment with Almost a Linear Factor , 2005, ICALP.