Online unit covering in Euclidean space
From MaRDI portal
Publication:5919348
DOI10.1016/j.tcs.2019.12.010zbMath1436.68380arXiv1710.00954MaRDI QIDQ5919348
Adrian Dumitrescu, Csaba D. Tóth, Anirban Ghosh
Publication date: 29 January 2020
Published in: Theoretical Computer Science, Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.00954
competitive ratio; lower bound; online algorithm; Newton number; illumination number; unit clustering; unit covering
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W27: Online algorithms; streaming algorithms