On the Online Unit Clustering Problem

DOI10.1007/978-3-540-77918-6_16zbMath1131.68599OpenAlexW2169102169MaRDI QIDQ5443383

Rob van Stee, Leah Epstein

Publication date: 20 February 2008

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77918-6_16

Mathematics Subject Classification ID

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

Related Items (4)

Better bounds on online unit clustering ⋮ Online unit clustering: Variations on a theme ⋮ A new model for the linear 1-dimensional online clustering problem ⋮ An improved algorithm for online unit clustering

Cites Work

• Unnamed Item
• An on-line graph coloring algorithm with sublinear performance ratio
• An Improved Algorithm for Online Unit Clustering
• On-line and first fit colorings of graphs
• Incremental Clustering and Dynamic Information Retrieval
• A Randomized Algorithm for Online Unit Clustering

This page was built for publication: On the Online Unit Clustering Problem