Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-APX-Reports 2000 Copyright 2000 University of Bonn, Department of Computer Science, Abt. V
8963

August 28, 2000

Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
Klaus Jansen, Marek Karpinski, Andrzej Lingas and Eike Seidel
[Download PostScript] [Download PDF]

We present a unified framework for constructing polynomial time approximation schemes (PTASs) for the problems of Max-Bisection on planar and geometric intersection graphs.

Last Change: 11/05/14 at 10:16:29
 Deutsch
University of Bonn -> Department of Computer Science -> Chair V