Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
SIAM Journal on Computing
Approximating geometric coverage problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation schemes for wireless networks
ACM Transactions on Algorithms (TALG)
Approximation algorithms for maximum independent set of pseudo-disks
Proceedings of the twenty-fifth annual symposium on Computational geometry
| Hi-index | 0.00 |
We give a simple framework as an alternative to the celebrated shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms with good approximation bounds for numerous optimization problems in low-dimensional Euclidean space. Our framework does not require the input graph/metric to have a geometric realization --- it only requires that the input graph satisfy some weak property referred to as growth boundedness. We show how to obtain polynomial time approximation schemes (PTAS) for maximum (weighted) independent set problem on this graph class. Via a more sophisticated application of our framework, we also show how to obtain a PTAS for the maximum (weighted) independent set for intersection graphs of (low-dimensional) fat objects that are expressed without geometry.