Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > PLANAR INSTANCES:
Reports tagged with Planar Instances:
TR02-046 | 16th July 2002
Marek Karpinski

On Approximability of Minimum Bisection Problem

We survey some recent results on the complexity of computing
approximate solutions for instances of the Minimum Bisection problem
and formulate some intriguing and still open questions about the
approximability status of that problem. Some connections to other
optimization problems are also indicated.

more >>>



ISSN 1433-8092 | Imprint