
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy 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 12November 14
ISBN: 0769508502
ASCII Text  x  
U. Feige, R. Krauthgamer, "A polylogarithmic approximation of the minimum bisection," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 105, 41st Annual Symposium on Foundations of Computer Science, 2000.  
BibTex  x  
@article{ 10.1109/SFCS.2000.892070, author = {U. Feige and R. Krauthgamer}, title = {A polylogarithmic approximation of the minimum bisection}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {2000}, issn = {02725428}, pages = {105}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892070}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 IEEE 54th Annual Symposium on Foundations of Computer Science TI  A polylogarithmic approximation of the minimum bisection SN  02725428 SP EP A1  U. Feige, A1  R. Krauthgamer, PY  2000 KW  computational complexity; graph theory; computational geometry; polylogarithmic approximation; minimum bisection; graph; vertices; vertex partitioning; bisection cost; edges; complexity; approximation ratio VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
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 NPhard. 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.