Worst-Case Efficient Dynamic Geometric Independent Set

08/18/2021
by   Jean Cardinal, et al.
0

We consider the problem of maintaining an approximate maximum independent set of geometric objects under insertions and deletions. We present data structures that maintain a constant-factor approximate maximum independent set for broad classes of fat objects in d dimensions, where d is assumed to be a constant, in sublinear worst-case update time. This gives the first results for dynamic independent set in a wide variety of geometric settings, such as disks, fat polygons, and their high-dimensional equivalents. Our result is obtained via a two-level approach. First, we develop a dynamic data structure which stores all objects and provides an approximate independent set when queried, with output-sensitive running time. We show that via standard methods such a structure can be used to obtain a dynamic algorithm with amortized update time bounds. Then, to obtain worst-case update time algorithms, we develop a generic deamortization scheme that with each insertion/deletion keeps (i) the update time bounded and (ii) the number of changes in the independent set constant. We show that such a scheme is applicable to fat objects by showing an appropriate generalization of a separator theorem. Interestingly, we show that our deamortization scheme is also necessary in order to obtain worst-case update bounds: If for a class of objects our scheme is not applicable, then no constant-factor approximation with sublinear worst-case update time is possible. We show that such a lower bound applies even for seemingly simple classes of geometric objects including axis-aligned rectangles in the plane.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/16/2020

Dynamic Geometric Independent Set

We present fully dynamic approximation algorithms for the Maximum Indepe...
research
08/02/2023

Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time

A fundamental question in computational geometry is for a dynamic collec...
research
10/25/2018

A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching

Many dynamic graph algorithms have an amortized update time, rather than...
research
03/31/2017

Optimal Reconstruction with a Small Number of Views

Estimating positions of world points from features observed in images is...
research
03/19/2019

Preprocessing Ambiguous Imprecise Points

Let R = {R_1, R_2, ..., R_n} be a set of regions and let X = {x_1, x_2,...
research
03/05/2020

Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles

Independent set is a fundamental problem in combinatorial optimization. ...
research
02/29/2020

Dynamic geometric set cover and hitting set

We investigate dynamic versions of geometric set cover and hitting set w...

Please sign up or login with your details

Forgot password? Click here to reset