A polylogarithmic approximation of the minimum bisection

A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. Finding the bisection of minimum cost is NP-hard. We present an algorithm that finds a bisection whose cost is within ratio of O(log/sup 2/ n) from the optimal. For graphs excluding any fixed graph as a minor (e.g. planar graphs) we obtain an improved approximation ratio of O(log n). The previously known approximation ratio for bisection was roughly /spl radic/n.

[1]  Vijay V. Vazirani,et al.  Finding k Cuts within Twice the Optimal , 1995, SIAM J. Comput..

[2]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[3]  Shang-Hua Teng,et al.  How Good is Recursive Bisection? , 1997, SIAM J. Sci. Comput..

[4]  Joseph Naor,et al.  Fast approximate graph partitioning algorithms , 1997, SODA '97.

[5]  Frank Thomson Leighton,et al.  A Framework for Solving VLSI Graph Layout Problems , 1984, J. Comput. Syst. Sci..

[6]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[7]  Yuval Rabani,et al.  An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..

[8]  Vijay V. Vazirani,et al.  Finding separator cuts in planar graphs within twice the optimal , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[9]  Vijay V. Vazirani,et al.  Finding k-cuts within twice the optimal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[10]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[11]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[12]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1980, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[13]  Jitendra Malik,et al.  Normalized Cuts and Image Segmentation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Vijay V. Vazirani,et al.  Finding Separator Cuts in Planar Graphs within Twice the Optimal , 1999, SIAM J. Comput..

[15]  Robert Krauthgamer,et al.  Approximating the minimum bisection size (extended abstract) , 2000, STOC '00.

[16]  Curt Jones,et al.  Finding Good Approximate Vertex and Edge Partitions is NP-Hard , 1992, Inf. Process. Lett..

[17]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[18]  David B. Shmoys,et al.  Cut problems and their application to divide-and-conquer , 1996 .

[19]  Philip N. Klein,et al.  Excluded minors, network decomposition, and multicommodity flow , 1993, STOC '93.

[20]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[21]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[22]  Marek Karpinski,et al.  Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems , 1999, J. Comput. Syst. Sci..

[23]  Frank Thomson Leighton,et al.  Graph bisection algorithms with good average case behavior , 1987, Comb..