A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
- 1 January 2004
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networksNetworks, 2003
- Ad-hoc networks beyond unit disk graphsPublished by Association for Computing Machinery (ACM) ,2003
- Polynomial-time approximation schemes for packing and piercing fat objectsJournal of Algorithms, 2003
- Unit disk graph recognition is NP-hardComputational Geometry, 1998
- Simple heuristics for unit disk graphsNetworks, 1995
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985