This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
41st Annual Symposium on Foundations of Computer Science
A polylogarithmic approximation of the minimum bisection
Redondo Beach, California
November 12-November 14
ISBN: 0-7695-0850-2
U. Feige, Dept. of Comput. Sci. & Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel
R. Krauthgamer, Dept. of Comput. Sci. & Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel
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.
Index Terms:
computational complexity; graph theory; computational geometry; polylogarithmic approximation; minimum bisection; graph; vertices; vertex partitioning; bisection cost; edges; complexity; approximation ratio
Citation:
U. Feige, R. Krauthgamer, "A polylogarithmic approximation of the minimum bisection," focs, pp.105, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.