A Note on Approximating MAX-BISECTION on Regular Graphs

13 years 10 months ago

Download eref.uqu.edu.sa

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

Real-time Traffic

Approximation Algorithm | ECCC 2000 | Max-Bisection Problem | Regular Graphs |

claim paper

» Prototype vector machine for large scale semisupervised learning

» Inapproximability of edgedisjoint paths and low congestion routing on undirected graphs

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	ECCC
Authors	Uriel Feige, Marek Karpinski, Michael Langberg

Comments (0)

Sciweavers

A Note on Approximating MAX-BISECTION on Regular Graphs

Approximation Algorithm | ECCC 2000 | Max-Bisection Problem | Regular Graphs |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers