Online geometric covering and piercing
We consider the online version of the piercing set problem, where geometric objects arrive
one by one, and the online algorithm must maintain a valid piercing set for the already …
one by one, and the online algorithm must maintain a valid piercing set for the already …
Online hitting of unit balls and hypercubes in Rd using points from Zd
We consider the online hitting set problem for the range space Σ=(X, R), where the point set
X is known beforehand, but the set R of geometric objects is not known in advance. Here …
X is known beforehand, but the set R of geometric objects is not known in advance. Here …
Online class cover problem
In this paper, we study the online class cover problem where a (finite or infinite) family F of
geometric objects and a set P r of red points in R d are given a prior, and blue points from R …
geometric objects and a set P r of red points in R d are given a prior, and blue points from R …
Online Hitting Set of d-Dimensional Fat Objects
S Alefkhani, N Khodaveisi, M Mari - International Workshop on …, 2023 - Springer
We consider an online version of the geometric minimum hitting set problem that can be
described as a game between an adversary and an algorithm. For some integers d and N …
described as a game between an adversary and an algorithm. For some integers d and N …