EEMCS EPrints Service
Nieberg, T. and Hurink, J.L. and Kern, W. (2004) A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs. In: Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, 21-23 Jun 2004, Bad Honnef, Germany. pp. 214-221. Lecture Notes in Computer Science 3353. Springer-Verlag. ISBN 3-540-24132-9
Full text available as:
Official URL: http://dx.doi.org/10.1007/978-3-540-30559-0_18
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).
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item