Better bounds on online unit clustering

DOI10.1007/978-3-642-13731-0_35zbMATH Open1285.68222OpenAlexW1544878700MaRDI QIDQ3569906FDOQ3569906

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

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

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Cited In (12)

• A Randomized Algorithm for Online Unit Clustering
• Online unit clustering: Variations on a theme
• An improved algorithm for online unit clustering
• Improved analysis of online balanced clustering
• Online unit clustering in higher dimensions
• Online clustering with variable sized clusters
• Online sum-radii clustering
• On the online unit clustering problem
• Online unit covering in Euclidean space
• An improved lower bound for one-dimensional online unit clustering
• Better bounds on online unit clustering
• On the Online Unit Clustering Problem

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)