Better bounds on online unit clustering

DOI10.1007/978-3-642-13731-0_35MaRDI QIDQ3569906zbMATH OpenOpenAlexFDO

Authors Martin R. Ehmsen, Kim S. Larsen

Publication date 22 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13731-0_35

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Recommendations

• Better bounds on 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

Cited in

(12)

• Online sum-radii clustering
• An improved algorithm for online unit clustering
• On the Online Unit Clustering Problem
• An improved lower bound for one-dimensional online unit clustering
• Online unit clustering and unit covering in higher dimensions
• 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
• Online clustering with variable sized clusters
• Improved analysis of online balanced clustering
• A Randomized Algorithm for Online Unit Clustering

This page was built for publication: Better bounds on online unit clustering

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