On Streaming Algorithms for Geometric Independent Set and Clique

07/03/2022
by   Sujoy Bhore, et al.
0

We study the maximum geometric independent set and clique problems in the streaming model. Given a collection of geometric objects arriving in an insertion only stream, the aim is to find a subset such that all objects in the subset are pairwise disjoint or intersect respectively. We show that no constant factor approximation algorithm exists to find a maximum set of independent segments or 2-intervals without using a linear number of bits. Interestingly, our proof only requires a set of segments whose intersection graph is also an interval graph. This reveals an interesting discrepancy between segments and intervals as there does exist a 2-approximation for finding an independent set of intervals that uses only O(α(ℐ)log |ℐ|) bits of memory for a set of intervals ℐ with α(ℐ) being the size of the largest independent set of ℐ. On the flipside we show that for the geometric clique problem there is no constant-factor approximation algorithm using less than a linear number of bits even for unit intervals. On the positive side we show that the maximum geometric independent set in a set of axis-aligned unit-height rectangles can be 4-approximated using only O(α(ℛ)log |ℛ|) bits.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/27/2019

Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams

We study the Maximum Independent Set problem for geometric objects given...
research
07/16/2020

Dynamic Geometric Independent Set

We present fully dynamic approximation algorithms for the Maximum Indepe...
research
02/25/2020

Stochastic Makespan Minimization in Structured Set Systems

We study stochastic combinatorial optimization problems where the object...
research
08/10/2020

Approximation in (Poly-) Logarithmic Space

We develop new approximation algorithms for classical graph and set prob...
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
12/12/2021

Temporal Unit Interval Independent Sets

Temporal graphs have been recently introduced to model changes to a give...
research
06/01/2021

A (2+ε)-Approximation Algorithm for Maximum Independent Set of Rectangles

We study the Maximum Independent Set of Rectangles (MISR) problem, where...

Please sign up or login with your details

Forgot password? Click here to reset