A new PTAS for Maximum Independent Sets in Unit Disk Graphs

Abstract

A unit disk graph is an intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum independent set problem in unit disk graphs. In contrast to previously known approximation schemes, our approach does not require a geometric representation (specifying the coordinates of the disk centers).

Extracted Key Phrases

Cite this paper

@inproceedings{Nieberg2003ANP, title={A new PTAS for Maximum Independent Sets in Unit Disk Graphs}, author={Tim Nieberg and Johann Hurink and Walter Kern}, year={2003} }