The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Polynomial time approximation schemes for max-bisection on planar and geometric graphs

På svenska

Author

Summary, in English

The max-bisection and min-bisection problems are to find a partition of the vertices of a graph into two equal size subsets that, respectively, maximizes or minimizes the number of edges with endpoints in both subsets. We design the first polynomial time approximation scheme for the max-bisection problem on arbitrary planar graphs solving a long-standing open problem. The method of solution involves designing exact polynomial time algorithms for computing optimal partitions of bounded treewidth graphs, in particular max- and min-bisection, which could be of independent interest. Using a similar method we design also the first polynomial time approximation scheme for max-bisection on unit disk graphs ( which could also be easily extended to other geometrically defined graphs).

Department/s

  • Computer Science

Publishing year

2005

Language

English

Pages

110-119

Publication/Series

SIAM Journal on Computing

Volume

35

Issue

1

Document type

Journal article

Publisher

Society for Industrial and Applied Mathematics

Topic

  • Computer Science

Keywords

  • graph bisection
  • planar graphs
  • combinatorial optimization
  • polynomial time approximation schemes
  • NP-hardness
  • approximation algorithms

Status

Published

Project

  • VR 2002-4049

ISBN/ISSN/Other

  • ISSN: 0097-5397