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$.

翻译：在线单位聚类问题中，度量空间中的点按序到达，必须被划分为直径不超过1的聚类，其成本为聚类数量。本文针对$\mathbb{R}^d$和$\mathbb{Z}^d$空间中的点数，给出了1-竞争性在线单位聚类算法建议复杂度的线性上界与下界。