On the Advice Complexity of Online Unit Clustering

In online unit clustering, points of a metric space arriving one by one must be partitioned into clusters of diameter at most 1, where the cost is the number of clusters. This paper gives linear upper and lower bounds on the advice complexity of 1-competitive online unit clustering algorithms, in terms of the number of points in ${\mathbb{R}}^d$ and ${\mathbb{Z}}^d$.