Better Balance by Being Biased: A 0.8776-Approximation for Max BisectionReport as inadecuate



 Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection


Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection - Download this document for free, or read online. Document in PDF available to download.

Download or read this book online for free in PDF: Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection
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 $\alpha {GW} + \epsilon \approx 0.8786$ under the Unique Games Conjecture (UGC), our algorithm is nearly optimal. We conjecture that Max Bise

Author: Per Austrin; Siavosh Benabbas; Konstantinos Georgiou

Source: https://archive.org/







Related documents