Sciweavers

ECCC
2000
179views more  ECCC 2000»
13 years 10 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 ...
Uriel Feige, Marek Karpinski, Michael Langberg