Better bounds on online unit clustering
From MaRDI portal
Publication:388452
DOI10.1016/J.TCS.2013.07.008zbMATH Open1296.68199OpenAlexW1974009900MaRDI QIDQ388452FDOQ388452
Authors: Martin R. Ehmsen, Kim S. Larsen 
Publication date: 19 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.07.008
Recommendations
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40)
Cites Work
- Title not available (Why is that?)
- Bounds for Certain Multiprocessing Anomalies
- Competitive snoopy caching
- An improved algorithm for online unit clustering
- Incremental Clustering and Dynamic Information Retrieval
- On the Online Unit Clustering Problem
- A randomized algorithm for online unit clustering
- Online unit clustering: Variations on a theme
Cited In (15)
- An online 2-dimensional clustering problem with variable sized clusters
- 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
- Improved analysis of online balanced clustering
- Online unit clustering and unit covering in higher dimensions
- Online unit clustering in higher dimensions
- An incremental version of the \(k\)-center problem on boundary of a convex polygon
- An Improved Algorithm for Online Unit Clustering
- On the online unit clustering problem
- An improved lower bound for one-dimensional online unit clustering
- Online coloring a token graph
- 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 Q388452)
