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. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Gibson, M., Kanade, G., & Varadarajan, K. (2011). On isolating points using disks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6942 LNCS, pp. 61–69). https://doi.org/10.1007/978-3-642-23719-5_6
Mendeley helps you to discover research relevant for your work.