Dynamic Geometric Set Cover and Hitting Set

We investigate dynamic versions of geometric set cover and hitting set where points and ranges may be inserted or deleted, and we want to efficiently maintain an (approximately) optimal solution for the current problem instance. While their static versions have been extensively studied in the past, surprisingly little is known about dynamic geometric set cover and hitting set. For instance, even for the most basic case of one-dimensional interval set cover and hitting set, no nontrivial results were known. The main contribution of our article are two frameworks that lead to efficient data structures for dynamically maintaining set covers and hitting sets in g1 and g2. The first framework uses bootstrapping and gives a (1 + ϵ)-approximate data structure for dynamic interval set cover in g1 with O(nα / ϵ) amortized update time for any constant α > 0; in g2, this method gives O(1)-approximate data structures for unit-square set cover and hitting set with O(n1/2+α) amortized update time. The second framework uses local modification and leads to a (1 + ϵ)-approximate data structure for dynamic interval hitting set in g1 with Õ(1/ϵ) amortized update time; in g2, it gives O(1)-approximate data structures for unit-square set cover and hitting set in the partially dynamic settings with Õ(1) amortized update time.

Duke Scholars

Author Pankaj K. Agarwal Computer Science