TY - GEN
T1 - Approximating the minimum bisection size (extended abstract)
AU - Feige, Uriel
AU - Krauthgamer, Robert
AU - Nissim, Kobbi
PY - 2000/12/1
Y1 - 2000/12/1
N2 - A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection size is the number of edges connecting the two sets. Finding the bisection of minimum size is NP-hard. We present an algorithm that finds a bisection that is within O(√n log n) of optimal. No sublinear approximation ratio for bisection was previously known.
AB - A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection size is the number of edges connecting the two sets. Finding the bisection of minimum size is NP-hard. We present an algorithm that finds a bisection that is within O(√n log n) of optimal. No sublinear approximation ratio for bisection was previously known.
UR - http://www.scopus.com/inward/record.url?scp=0033723963&partnerID=8YFLogxK
U2 - 10.1145/335305.335370
DO - 10.1145/335305.335370
M3 - Conference contribution
AN - SCOPUS:0033723963
SN - 1581131844
SN - 9781581131840
T3 - Proceedings of the Annual ACM Symposium on Theory of Computing
SP - 530
EP - 536
BT - Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000
T2 - 32nd Annual ACM Symposium on Theory of Computing, STOC 2000
Y2 - 21 May 2000 through 23 May 2000
ER -