Better Balance by Being Biased

Recently, Raghavendra and Tan (SODA 2012) gave a 0.85-approximation algorithm for the Max Bisection problem. We improve their algorithm to a 0.8776-approximation. As Max Bisection is hard to approximate within αGW + ε ≈ 0.8786 under the Unique Games Conjecture (UGC), our algorithm is nearly optimal. We conjecture that Max Bisection is approximable within αGW − ε, that is, that the bisection constraint (essentially) does not make Max Cut harder. We also obtain an optimal algorithm (assuming the UGC) for the analogous variant of Max 2-Sat. Our approximation ratio for this problem exactly matches the optimal approximation ratio for Max 2-Sat, that is, αLLZ + ε ≈ 0.9401, showing that the bisection constraint does not make Max 2-Sat harder. This improves on a 0.93-approximation for this problem from Raghavendra and Tan.

[1]  Guy Kindler,et al.  Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[2]  Marek Karpinski,et al.  Polynomial time approximation schemes for dense instances of NP-hard problems , 1995, STOC '95.

[3]  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 .

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

[5]  Uriel Feige,et al.  Relations between average case complexity and approximation complexity , 2002, STOC '02.

[6]  Prasad Raghavendra,et al.  Approximating CSPs with global cardinality constraints using SDP hierarchies , 2011, SODA.

[7]  Subhash Khot,et al.  SDP Integrality Gaps with Local ell_1-Embeddability , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[8]  A KhotSubhash,et al.  The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ1 , 2015 .

[9]  Marek Karpinski,et al.  Improved approximation of Max-Cut on graphs of bounded degree , 2002, J. Algorithms.

[10]  Alan M. Frieze,et al.  Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION , 1995, IPCO.

[11]  Prasad Raghavendra,et al.  Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.

[12]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[13]  Uri Zwick,et al.  Computer assisted proof of optimal approximability results , 2002, SODA '02.

[14]  Rishi Saket,et al.  SDP Integrality Gaps with Local̀ 1-Embeddability Subhash Khot , 2009 .

[15]  Jean B. Lasserre,et al.  An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs , 2002, SIAM J. Optim..

[16]  Per Austrin,et al.  Balanced max 2-sat might not be the hardest , 2007, STOC '07.

[17]  Uri Zwick,et al.  A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems , 2001, Random Struct. Algorithms.

[18]  Uri Zwick,et al.  Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems , 2002, IPCO.

[19]  Ryan O'Donnell,et al.  An optimal sdp algorithm for max-cut, and equally optimal long code tests , 2008, STOC.

[20]  Madhur Tulsiani,et al.  Convex Relaxations and Integrality Gaps , 2012 .

[21]  Uriel Feige,et al.  On the integrality ratio of semidefinite relaxations of MAX CUT , 2001, STOC '01.

[22]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[23]  Yinyu Ye,et al.  A .699-Approximation Algorithm for Max-Bisection , 1999 .

[24]  Michael Langberg,et al.  The RPR2 rounding technique for semidefinite programs , 2006, J. Algorithms.

[25]  Marek Karpinski,et al.  A note on approximating Max-Bisection on regular graphs , 2001, Inf. Process. Lett..

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