2 papers
cs.CC2025
MAX BISECTION might be harder to approximate than MAX CUT
Joshua Brakensiek, Neng Huang, Aaron Potechin +1
The MAX BISECTION problem seeks a maximum-size cut that evenly divides the vertices of a given undirected graph. An open problem raised by Austrin, Benabbas, and Georgiou is whethe…
cs.CC2023
Tight approximability of MAX 2-SAT and relatives, under UGC
Joshua Brakensiek, Neng Huang, Uri Zwick
Austrin showed that the approximation ratio obtained by the MAX 2-SAT approximation algorithm of Lewin, Livnat and Zwick (LLZ) is optimal modulo the Unique Ga…