1 citations · 1 across the 1 of their papers we have counts for
1 paper
Per Austrin, Siavosh Benabbas, Konstantinos Georgiou
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 i…