A Randomized Algorithm for Online Unit Clustering

DOI10.1007/11970125_10MaRDI QIDQ5443514zbMATH OpenOpenAlexFDO

Authors Timothy M. Chan, Hamid Zarrabi-Zadeh

Publication date 21 February 2008

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11970125_10

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40) Clustering in the social and behavioral sciences (91C20)

Recommendations

• A randomized algorithm for online unit clustering
• On the Online Unit Clustering Problem
• On the online unit clustering problem
• An Improved Algorithm for Online Unit Clustering
• An improved algorithm for online unit clustering
• Better bounds on online unit clustering
• Better bounds on online unit clustering
• Online unit clustering in higher dimensions
• Online unit clustering: Variations on a theme
• An improved lower bound for one-dimensional online unit clustering

Cited in

(9)

• An improved algorithm for online unit clustering
• Online unit clustering in higher dimensions
• A new model for the linear 1-dimensional online clustering problem
• Online weight balancing on the unit circle
• An Improved Algorithm for Online Unit Clustering
• An online 2-dimensional clustering problem with variable sized clusters
• On the Online Unit Clustering Problem
• A randomized algorithm for online unit clustering
• Online unit clustering: Variations on a theme

This page was built for publication: A Randomized Algorithm for Online Unit Clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5443514)