Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Unit disk graph recognition is NP-hard
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Robust algorithms for restricted domains
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Concrete Math
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Collaborative algorithms for communication in wireless sensor networks
Ambient intelligence
Local approximation schemes for ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
Discrete Applied Mathematics
Approximation schemes for wireless networks
ACM Transactions on Algorithms (TALG)
The Roman Domination Problem in Unit Disk Graphs
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Approximating minimum independent dominating sets in wireless networks
Information Processing Letters
Multiflows in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Approximation algorithms for maximum independent set of pseudo-disks
Proceedings of the twenty-fifth annual symposium on Computational geometry
Low complexity stable link scheduling for maximizing throughput in wireless networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Better approximation schemes for disk graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
A PTAS for the minimum dominating set problem in unit disk graphs
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Approximation algorithms for unit disk graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
ACM Transactions on Algorithms (TALG)
Algorithms for graphs embeddable with few crossings per edge
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Independence and coloring problems on intersection graphs of disks
Efficient Approximation and Online Algorithms
Shifting strategy for geometric graphs without geometry
Journal of Combinatorial Optimization
Integer realizations of disk and segment graphs
Journal of Combinatorial Theory Series B
European Journal of Combinatorics
| Hi-index | 0.00 |
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.