
Universität Bonn > Institut für Informatik > Abteilung V  
CSReports 2000  Copyright 2000 Universität Bonn, Institut für Informatik, Abt. V  
85218

A Polynomial Time Approximation Scheme for MAXBISECTION on Planar Graphs
Klaus Jansen, Marek Karpinski and Andrzej Lingas [Download PostScript] [Download PDF] The MaxBisection and MinBisection are the problems of finding partitions of the vertices of a given graph into two equal size subsets so as to maximizes or minimizes, respectively, the number of edges with exactly one endpoint in each subset. In this paper we design the first polynomial time approximation scheme for the MaxBisection problem on arbitrary planar graphs solving a long time standing open problem. The method of solution involves a design of exact polynomial time algorithms for computing optimal partitions of bounded treewidth graphs, in particular their Max and MinBisections, which could be also of independent interest. 

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