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

• Type: Conference
• Year: 2000
• Where: FOCS
• Authors: Uriel Feige, Robert Krauthgamer
• Keywords: Bisection, Bisection Cost, FOCS 2000, Minimum Cost, Theoretical Computer Science