On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Discrete & Computational Geometry
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Multiway cuts in node weighted graphs
Journal of Algorithms
Improved approximation algorithms for geometric set cover
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Maximum independent set of rectangles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
PTAS for geometric hitting set problems via local search
Proceedings of the twenty-fifth annual symposium on Computational geometry
Approximation algorithms for maximum independent set of pseudo-disks
Proceedings of the twenty-fifth annual symposium on Computational geometry
Approximating Barrier Resilience in Wireless Sensor Networks
Algorithmic Aspects of Wireless Sensor Networks
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
SIAM Journal on Computing
Computing the independence number of intersection graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The complexity of separating points in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
In this paper, we consider the problem of choosing disks (that we can think of as corresponding to wireless sensors) so that given a set of input points in the plane, there exists no path between any pair of these points that is not intercepted by some disk. We try to achieve this separation using a minimum number of a given set of unit disks. We show that a constant factor approximation to this problem can be found in polynomial time using a greedy algorithm. To the best of our knowledge we are the first to study this optimization problem.