Online unit clustering and unit covering in higher dimensions
From MaRDI portal
Publication:2134741
DOI10.1007/s00453-021-00916-6OpenAlexW4205839473MaRDI QIDQ2134741
Adrian Dumitrescu, Csaba D. Tóth
Publication date: 3 May 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-021-00916-6
Related Items (2)
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\)
Cites Work
- Unnamed Item
- Unnamed Item
- Better bounds on online unit clustering
- An online 2-dimensional clustering problem with variable sized clusters
- An improved lower bound for one-dimensional online unit clustering
- Approximation algorithms for the unit disk cover problem in 2D and 3D
- A randomized algorithm for online unit clustering
- Online unit clustering: Variations on a theme
- An improved algorithm for online unit clustering
- Clustering to minimize the maximum intercluster distance
- Optimal packing and covering in the plane are NP-complete
- On the power of randomization in on-line algorithms
- Online clustering with variable sized clusters
- The Design of Approximation Algorithms
- Research Problems in Discrete Geometry
- Online Primal-Dual Algorithms for Covering and Packing
- On the online unit clustering problem
- On the Complexity of Some Common Geometric Location Problems
- The Online Set Cover Problem
- Approximation schemes for covering and packing problems in image processing and VLSI
- Online Lower Bounds via Duality
- Incremental Clustering and Dynamic Information Retrieval
- Approximating Sparse Covering Integer Programs Online
- Online Mixed Packing and Covering
- Online unit covering in Euclidean space
This page was built for publication: Online unit clustering and unit covering in higher dimensions
