Polynomial-time approximation schemes for geometric graphs

  • Authors:

  • Thomas Erlebach;Klaus Jansen;Eike Seidel

  • Affiliations:

  • Computer Engineering and Networks Laboratory, Dept. of Electrical Engineering, ETH Zürich, CH-8092 Zürich, Switzerland;Institute for Computer Science and Applied Mathematics, Christian-Albrechts-University of Kiel, Olshausenstr. 40, D-24098, Kiel, Germany;Institute for Computer Science and Applied Mathematics, Christian-Albrechts-University of Kiel, Olshausenstr. 40, D-24098, Kiel, Germany

  • Venue:
  • SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

A disk graph is the intersection graph of a set of disks with arbitrary diameters in the plane. For the case that the disk representation is given, we present polynomial-time approximation schemes (PTASs) for the maximum weight independent set problem (selecting disjoint disks of maximum total weight) and for the minimum weight vertex cover problem in disk graphs. These are the first known PTASs for NP-hard optimization problems on disk graphs. They are based on a novel recursive subdivision of the plane that allows applying a shifting strategy on different levels simultaneously, so that a dynamic programming approach becomes feasible. The PTASs for disk graphs represent a common generalization of previous results for planar graphs and unit disk graphs. They can be extended to intersection graphs of other “disk-like” geometric objects (such as squares or regular polygons), also in higher dimensions.