The k-center problem is a classical clustering problem in which one is
a...
Motivated by an application from geodesy, we introduce a novel clusterin...
We study (Euclidean) k-median and k-means with constraints in the
stream...
We study k-clustering problems with lower bounds, including k-median and...
The k-means++ algorithm due to Arthur and Vassilvitskii has become the m...
We develop dynamic data structures for maintaining a hierarchical k-cent...
We study Ward's method for the hierarchical k-means problem. This popula...
We study metric data structures for curves in doubling spaces, such as
t...
We study fair clustering problems as proposed by Chierichetti et al. Her...
Clustering is a fundamental tool in data mining. It partitions points in...
We develop and analyze a method to reduce the size of a very large set o...
The k-center problem is a classical combinatorial optimization problem
w...