Online hitting set of $d$-dimensional fat objects
Shanli Alefkhani, Nima Khodaveisi, Mathieu Mari

TL;DR
This paper introduces a deterministic online algorithm for the geometric hitting set problem involving fat objects in d-dimensional space, achieving a competitive ratio that is near-optimal and applicable to common shapes like disks and cubes.
Contribution
The paper presents a new online algorithm with a proven competitive ratio for the geometric hitting set problem involving fat objects, resolving open questions for specific shapes.
Findings
Algorithm achieves competitive ratio of ((4α+1)^{2d} log N).
No better ratio possible for fixed α and d.
Applicable to disks and d-cubes in 2D and higher dimensions.
Abstract
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 and , let be the set of points in with integral coordinates, and let be a family of subsets of , called objects. Both and are known in advance by the algorithm and by the adversary. Then, the adversary gives some objects one by one, and the algorithm has to maintain a valid hitting set for these objects using points from , with an immediate and irrevocable decision. We measure the performance of the algorithm by its competitive ratio, that is the ratio between the number of points used by the algorithm and the offline minimum hitting set for the sub-sequence of objects chosen by the adversary. We present a simple deterministic online algorithm with competitive…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Computational Geometry and Mesh Generation · Optimization and Search Problems
