Online Sum-Radii Clustering

DOI10.1007/978-3-642-32589-2_36zbMath1365.68476OpenAlexW1656336187WikidataQ59818420 ScholiaQ59818420MaRDI QIDQ2912738

Dimitris Fotakis, Paraschos Koutris

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_36

Mathematics Subject Classification ID

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

Related Items (3)

Dynamic clustering to minimize the sum of radii ⋮ Dynamic Sum-Radii Clustering ⋮ Unnamed Item

This page was built for publication: Online Sum-Radii Clustering