Sciweavers

Share
WG
2004
Springer

A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs

10 years 8 months ago
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight 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). The approximation algorithm presented is robust in the sense that it accepts any graph as input and either returns a (1 + ε)-approximate independent set or a certificate showing that the input graph is no unit disk graph. The algorithm can easily be extended to other families of intersection graphs of geometric objects.
Tim Nieberg, Johann Hurink, Walter Kern
Added 03 Jul 2010
Updated 03 Jul 2010
Type Conference
Year 2004
Where WG
Authors Tim Nieberg, Johann Hurink, Walter Kern
Comments (0)
books