Better bounds on online unit clustering

DOI10.1016/J.TCS.2013.07.008zbMath1296.68199OpenAlexW1974009900MaRDI QIDQ388452

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

zbMATH Keywords

clusteringcompetitive analysisonline algorithms

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms (68W40) Online algorithms; streaming algorithms (68W27)

Related Items (6)

Online unit clustering and unit covering in higher dimensions ⋮ An incremental version of the \(k\)-center problem on boundary of a convex polygon ⋮ An online 2-dimensional clustering problem with variable sized clusters ⋮ An improved lower bound for one-dimensional online unit clustering ⋮ Online unit covering in Euclidean space ⋮ Online coloring a token graph

Cites Work

• Unnamed Item
• A randomized algorithm for online unit clustering
• Online unit clustering: Variations on a theme
• An improved algorithm for online unit clustering
• Competitive snoopy caching
• Incremental Clustering and Dynamic Information Retrieval
• On the Online Unit Clustering Problem
• Bounds for Certain Multiprocessing Anomalies

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