Approximability of the Minimum Bisection Problem: An Algorithmic Challenge [chapter]

Marek Karpinski
2002 Lecture Notes in Computer Science  
We survey some recent results on the complexity of computing approximate solutions for instances of the Minimum Bisection problem and formulate some very intriguing and still open questions about the approximability status of that problem.
doi:10.1007/3-540-45687-2_4 fatcat:k7art7ukvrgshkquf65he4juha