Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

FOCS
2000
IEEE

favoriteEmaildiscussreport

143views Theoretical Computer Science» more FOCS 2000»

A polylogarithmic approximation of the minimum bisection

13 years 9 months ago

A polylogarithmic approximation of the minimum bisection

Download www.wisdom.weizmann.ac.il

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. The problem of ﬁnding a bisection of minimum cost is prototypical to graph partitioning problems, which arise in numerous contexts. This problem is NP-hard. We present an algorithm that ﬁnds a bisection whose

Uriel Feige, Robert Krauthgamer

Real-time Traffic

Bisection | Bisection Cost | FOCS 2000 | Minimum Cost | Theoretical Computer Science |

claim paper

Related Content

» Balanced graph partitioning

» On Approximability of Minimum Bisection Problem

» A Comparative Study of Linear and Semidefinite BranchandCut Methods for Solving the Minimu...

» MinimumCost Network Design with Diseconomies of Scale

» Spectral techniques for graph bisection in genetic algorithms

» Distributed Approximation Algorithms for Planar Graphs

» On Minimum Power Connectivity Problems

» Edge Disjoint Paths in Moderately Connected Graphs

» Polynomial time approximation schemes for dense instances of NPhard problems

Post Info
More Details (n/a)

Added	31 Jul 2010
Updated	31 Jul 2010
Type	Conference
Year	2000
Where	FOCS
Authors	Uriel Feige, Robert Krauthgamer

Comments (0)