Faster Approximation Algorithms for Geometric Set Cover

03/26/2020

∙

by   Timothy M. Chan, et al.

∙

0

∙

share

We improve the running times of O(1)-approximation algorithms for the set cover problem in geometric settings, specifically, covering points by disks in the plane, or covering points by halfspaces in three dimensions. In the unweighted case, Agarwal and Pan [SoCG 2014] gave a randomized O(nlog^4 n)-time, O(1)-approximation algorithm, by using variants of the multiplicative weight update (MWU) method combined with geometric data structures. We simplify the data structure requirement in one of their methods and obtain a deterministic O(nlog^3 nloglog n)-time algorithm. With further new ideas, we obtain a still faster randomized O(nlog n(loglog n)^O(1))-time algorithm. For the weighted problem, we also give a randomized O(nlog^4nloglog n)-time, O(1)-approximation algorithm, by simple modifications to the MWU method and the quasi-uniform sampling technique.