On the Advice Complexity of Online Unit Clustering
CoRR(2023)
摘要
In online unit clustering a set of n points of a metric space that arrive one by one, partition the points into clusters of diameter at most one, so that number of clusters is minimized. This paper gives linear upper and lower bounds for the advice complexity of 1-competitive online unit clustering algorithms in terms of number of points in $\mathbb{R}^d$ and $\mathbb{Z}^d$.
更多查看译文
关键词
advice complexity
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要