Sciweavers

Share
ECCC
2000

A Note on Approximating MAX-BISECTION on Regular Graphs

9 years 8 months ago
A Note on Approximating MAX-BISECTION on Regular Graphs
We design a 0:795 approximation algorithm for the Max-Bisection problem restricted to regular graphs. In the case of three regular graphs our results imply an approximation ratio of 0:834.
Uriel Feige, Marek Karpinski, Michael Langberg
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2000
Where ECCC
Authors Uriel Feige, Marek Karpinski, Michael Langberg
Comments (0)
books