Approximation of non-boolean 2CSP

We develop a polynomial time Ω (1/R log R) approximate algorithm for Max 2CSP-R, the problem where we are given a collection of constraints, each involving two variables, where each variable ranges over a set of size R, and we want to find an assignment to the variables that maximizes the number of satisfied constraints. Assuming the Unique Games Conjecture, this is the best possible approximation up to constant factors. Previously, a 1/R-approximate algorithm was known, based on linear programming. Our algorithm is based on semidefinite programming. The Semidefinite Program that we use has an almost-matching integrality gap. For the more general Max kCSP-R, in which each constraint involves k variables, each ranging over a set of size R, it was known that the best possible approximation is of the order of k/Rk-1, provided that k is sufficiently large compared to R; our algorithm shows that the bound k/Rk-1 is not tight for k = 2.

[1]  Nisheeth K. Vishnoi,et al.  The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into 1 (Extended Abstract) , 2005 .

[2]  Moses Charikar,et al.  Near-optimal algorithms for unique games , 2006, STOC '06.

[3]  Carsten Lund,et al.  Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.

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

[5]  Maria J. Serna,et al.  The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming , 1998, STACS.

[6]  Nisheeth K. Vishnoi,et al.  The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l/sub 1/ , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[7]  Konstantin Makarychev,et al.  Approximation Algorithm for Non-Boolean Max-k-CSP , 2014, Theory Comput..

[8]  Ryan O'Donnell,et al.  Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? , 2007, SIAM J. Comput..

[9]  Johan Håstad,et al.  Every 2-csp Allows Nontrivial Approximation , 2005, STOC '05.

[10]  Siu On Chan,et al.  Approximation resistance from pairwise independent subgroups , 2013, STOC '13.

[11]  Moses Charikar,et al.  Near-optimal algorithms for maximum constraint satisfaction problems , 2007, SODA '07.

[12]  Nisheeth K. Vishnoi,et al.  The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.

[13]  Uriel Feige,et al.  On Systems of Linear Equations with Two Variables per Equation , 2004, APPROX-RANDOM.