A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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