Now showing items 1-3 of 3
On Clustering to Minimize the Sum of Radii
(SIAM Journal on Computing;41(1), 2012-01-05)
Let P be a set of n points in the plane. Consider the problem of finding k disks, each centered at a point in P, whose union covers P with the objective of minimizing the sum of the radii of the disks. We present an exact ...
On Isolating Points Using Unit Disks
(Journal of Computational Geometry;Vol. 7 No. 1, 2016)
Given a set of points in the plane and a set of disks which separate the points, we consider the problem of selecting a minimum size subset of the disks such that any path between any pair of points is intersected by at ...
Guarding Terrains Via Local Search
(Journal of Computational Geometry;Vol. 5 No. 1, 2014-05-30)
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algorithm inspired by the recent results of ...