Online geometric covering and piercing
From MaRDI portal
Publication:6614105
DOI10.1007/S00453-024-01244-1MaRDI QIDQ6614105
Saksham Jain, Sarat Varma Kallepalli, Satyam Singh, Minati De
Publication date: 7 October 2024
Published in: Algorithmica (Search for Journal in Brave)
geometric objectscompetitive ratioonline algorithmfat objectspiercing set problemunit covering problem
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hitting sets online and unique-MAX coloring
- A randomized algorithm for online unit clustering
- Optimal packing and covering in the plane are NP-complete
- On convex body chasing
- Maintenance of a piercing set for intervals with applications
- Fast stabbing of boxes in high dimensions
- Realistic input models for geometric algorithms
- Dynamic data structures for fat objects and their applications
- Online unit clustering and unit covering in higher dimensions
- Near-linear algorithms for geometric hitting sets and set covers
- Research Problems in Discrete Geometry
- The Online Set Cover Problem
- Incremental Clustering and Dynamic Information Retrieval
- Polynomial-time approximation schemes for packing and piercing fat objects
- Chasing Convex Bodies with Linear Competitive Ratio
- Better Bounds for Online Line Chasing
- Chasing Nested Convex Bodies Nearly Optimally
- Chasing Convex Bodies Optimally
- Competitively chasing convex bodies
- Online unit covering in Euclidean space
- Hitting geometric objects online via points in \(\mathbb{Z}^d\)
- Online hitting of unit balls and hypercubes in \(\mathbb{R}^d\) using points from \(\mathbb{Z}^d\)
- Online and dynamic algorithms for geometric set cover and hitting set
This page was built for publication: Online geometric covering and piercing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614105)
