Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
 
Abteilung V

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-APX-Reports 2002 Copyright 2002 Universität Bonn, Institut für Informatik, Abt. V
8979

May 15, 2002

Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
Marek Karpinski
[Download PostScript] [Download PDF]

We survey some recent results on the complexity of computing approximate solutions for instances of the proximate solutions for instances of the Minimum Bisection problem and formulate some very intriguing and still open questions about the approximability status of that problem.

Last Change: 11/05/14 at 10:25:19
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope