Sciweavers

Share
FOCS
2000
IEEE

A polylogarithmic approximation of the minimum bisection

8 years 11 months ago
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. The problem of finding 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 finds a bisection whose
Uriel Feige, Robert Krauthgamer
Added 31 Jul 2010
Updated 31 Jul 2010
Type Conference
Year 2000
Where FOCS
Authors Uriel Feige, Robert Krauthgamer
Comments (0)
books