An Improved Algorithm for Online Unit Clustering

DOI10.1007/978-3-540-73545-8_38MaRDI QIDQ3608863zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• An improved algorithm for online unit clustering
• A randomized algorithm for online unit clustering
• A Randomized Algorithm for Online Unit Clustering
• Better bounds on online unit clustering
• On the Online Unit Clustering Problem

Cited in

(13)

• An improved algorithm for online unit clustering
• On the Online Unit Clustering Problem
• An improved lower bound for one-dimensional online unit clustering
• Better bounds on online unit clustering
• Online weight balancing on the unit circle
• A new model for the linear 1-dimensional online clustering problem
• Online unit clustering in higher dimensions
• On the online unit clustering problem
• Better bounds on online unit clustering
• Online unit clustering: Variations on a theme
• A randomized algorithm for online unit clustering
• Improved analysis of online balanced clustering
• A Randomized Algorithm for Online Unit Clustering

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)