An Improved Algorithm for Online Unit Clustering
From MaRDI portal
Publication:3608863
DOI10.1007/978-3-540-73545-8_38zbMATH Open1176.68248OpenAlexW1577356920MaRDI QIDQ3608863FDOQ3608863
Authors: Hamid Zarrabi-Zadeh, Timothy M. Chan 
Publication date: 6 March 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_38
Recommendations
Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Analysis of algorithms (68W40)
Cited In (13)
- A randomized algorithm for online unit clustering
- A Randomized Algorithm for Online Unit Clustering
- Online unit clustering: Variations on a theme
- An improved algorithm for online unit clustering
- Online weight balancing on the unit circle
- Improved analysis of online balanced clustering
- Online unit clustering in higher dimensions
- A new model for the linear 1-dimensional online clustering problem
- On the online unit clustering problem
- An improved lower bound for one-dimensional online unit clustering
- Better bounds on online unit clustering
- Better bounds on online unit clustering
- On the Online Unit Clustering Problem
This page was built for publication: An Improved Algorithm for Online Unit Clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608863)
