On the online unit clustering problem

DOI10.1145/1868237.1868245zbMath1295.68220OpenAlexW2073006754MaRDI QIDQ3188989

Rob van Stee, Leah Epstein

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1868237.1868245

zbMATH Keywords

clusteringonline algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)

Related Items (7)

Online unit clustering and unit covering in higher dimensions ⋮ An online 2-dimensional clustering problem with variable sized clusters ⋮ Online clustering with variable sized clusters ⋮ Online sum-radii clustering ⋮ An improved lower bound for one-dimensional online unit clustering ⋮ Online unit covering in Euclidean space ⋮ Online coloring a token graph

This page was built for publication: On the online unit clustering problem