On the online unit clustering problem

DOI10.1145/1868237.1868245MaRDI QIDQ3188989zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Rob van Stee

Publication date 9 September 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1868237.1868245

zbMATH Keywords

clusteringonline algorithms

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05) Online algorithms; streaming algorithms (68W27)

Recommendations

• On the Online Unit Clustering Problem
• Better bounds on online unit clustering
• Better bounds on online unit clustering
• An Improved Algorithm for Online Unit Clustering
• An improved algorithm for online unit clustering

Cited in

(14)

• An improved algorithm for online unit clustering
• Online unit clustering in higher dimensions
• Online clustering with variable sized clusters
• Online unit clustering and unit covering in higher dimensions
• A new model for the linear 1-dimensional online clustering problem
• Online coloring a token graph
• Online sum-radii clustering
• Better bounds on online unit clustering
• Better bounds on online unit clustering
• An online 2-dimensional clustering problem with variable sized clusters
• An improved lower bound for one-dimensional online unit clustering
• 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: On the online unit clustering problem

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