Home > Publications
Home University of Twente
Prospective Students
Intranet (internal)

EEMCS EPrints Service

1784 A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
Home Policy Brochure Browse Search User Area Contact Help

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:

PDF (Full Paper)

143 Kb
Open Access

Official URL:


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.

Item Type:Conference or Workshop Paper (Full Paper, Talk)
Research Group:EWI-DMMP: Discrete Mathematics and Mathematical Programming, EWI-CAES: Computer Architecture for Embedded Systems
Research Program:CTIT-UBRICKS: Building Blocks for Ubiquitous Computing and Communication
Research Project:EYES: Energy-Efficient Sensor Networks
ID Code:1784
Deposited On:03 May 2006
More Information:statistics

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item