We consider the problem of clustering privately a dataset in ℝ^d
that un...
Given a set of n points in d dimensions, the Euclidean k-means problem
(...
We study the private k-median and k-means clustering problem in d
dimens...
Given a set of points in a metric space, the (k,z)-clustering problem
co...
We present a new local-search algorithm for the k-median clustering
prob...
Given a metric space, the (k,z)-clustering problem consists of finding k...
We study clustering problems such as k-Median, k-Means, and Facility Loc...
In this paper we study the dynamic versions of two basic graph problems:...
We consider the classic Facility Location, k-Median, and k-Means problem...