A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We revisit the online Unit Clustering problem in higher dimensions: Given a set of n points in R d , that arrive one by one, partition the points into clusters (subsets) of diameter at most one, so as to minimize the number of clusters used. In this paper, we work in R d using the L ∞ norm. We show that the competitive ratio of any algorithm (deterministic or randomized) for this problem must depend on the dimension d. This resolves an open problem raised by Epstein and van Stee (WAOA 2008). Wedoi:10.1007/978-3-319-89441-6_18 fatcat:bsw2tmso2bdtzojthumahiaxse