Dynamic geometric set cover and hitting set

by   Pankaj K. Agarwal, et al.

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 paper are two frameworks that lead to efficient data structures for dynamically maintaining set covers and hitting sets in ℝ^1 and ℝ^2. The first framework uses bootstrapping and gives a (1+ε)-approximate data structure for dynamic interval set cover in ℝ^1 with O(n^α/ε) amortized update time for any constant α > 0; in ℝ^2, this method gives O(1)-approximate data structures for unit-square (and quadrant) set cover and hitting set with O(n^1/2+α) amortized update time. The second framework uses local modification, and leads to a (1+ε)-approximate data structure for dynamic interval hitting set in ℝ^1 with O(1/ε) amortized update time; in ℝ^2, it gives O(1)-approximate data structures for unit-square (and quadrant) set cover and hitting set in the partially dynamic settings with O(1) amortized update time.



There are no comments yet.


page 1

page 2

page 3

page 4


Dynamic Geometric Set Cover, Revisited

Geometric set cover is a classical problem in computational geometry, wh...

More Dynamic Data Structures for Geometric Set Cover with Sublinear Update Time

We study geometric set cover problems in dynamic settings, allowing inse...

Competitive Data-Structure Dynamization

Data-structure dynamization is a general approach for making static data...

Worst-Case Efficient Dynamic Geometric Independent Set

We consider the problem of maintaining an approximate maximum independen...

Optimal data structures for stochastic driven simulations

Simulations where we have some prior information on the probability dist...

Faster Approximation Algorithms for Geometric Set Cover

We improve the running times of O(1)-approximation algorithms for the se...

Sublinear Dynamic Interval Scheduling (on one or multiple machines)

We revisit the complexity of the classical Interval Scheduling in the dy...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.