An O(logn)-Approximation Algorithm for the Minimum Bisection Problem in Planar Graphs
Ji Wang · Journal of Shandong University · 2003
The research object is limited to the minimum bisection problem in planar graphs. The idea of “decomposition combination” owing to U. Feige and R. Krauthgamer is used for reference. However, there are new preferable improvements in designing the algorithm;also a better approximation ratio, O (log n ), is achieved.