Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles

by   Monika Henzinger, et al.

Independent set is a fundamental problem in combinatorial optimization. While in general graphs the problem is essentially inapproximable, for many important graph classes there are approximation algorithms known in the offline setting. These graph classes include interval graphs and geometric intersection graphs, where vertices correspond to intervals/geometric objects and an edge indicates that the two corresponding objects intersect. We present dynamic approximation algorithms for independent set of intervals, hypercubes and hyperrectangles in d dimensions. They work in the fully dynamic model where each update inserts or deletes a geometric object. All our algorithms are deterministic and have worst-case update times that are polylogarithmic for constant d and ϵ> 0, assuming that the coordinates of all input objects are in [0, N]^d and each of their edges has length at least 1. We obtain the following results: ∙ For weighted intervals, we maintain a (1+ϵ)-approximate solution. ∙ For d-dimensional hypercubes we maintain a (1+ϵ)2^d-approximate solution in the unweighted case and a O(2^d)-approximate solution in the weighted case. Also, we show that for maintaining an unweighted (1+ϵ)-approximate solution one needs polynomial update time for d≥2 if the ETH holds. ∙ For weighted d-dimensional hyperrectangles we present a dynamic algorithm with approximation ratio (1+ϵ)log^d-1N.



There are no comments yet.


page 1

page 2

page 3

page 4


Dynamic Geometric Independent Set

We present fully dynamic approximation algorithms for the Maximum Indepe...

Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams

We study the Maximum Independent Set problem for geometric objects given...

Sublinear Dynamic Interval Scheduling (on one or multiple machines)

We revisit the complexity of the classical Interval Scheduling in the dy...

Worst-Case Efficient Dynamic Geometric Independent Set

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

Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading

We consider dynamic loading and unloading problems for heavy geometric o...

Algorithms for Intersection Graphs of Multiple Intervals and Pseudo Disks

Intersection graphs of planar geometric objects such as intervals, disks...

Approximating MIS over equilateral B_1-VPG graphs

We present an approximation algorithm for the maximum independent set (M...
This week in AI

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