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.

• Type: Journal
• Year: 2000
• Where: ECCC
• Authors: Uriel Feige, Marek Karpinski, Michael Langberg
• Keywords: Approximation Algorithm, ECCC 2000, Max-Bisection Problem, Regular Graphs