research
∙
07/07/2023
Differential Privacy for Clustering Under Continual Observation
We consider the problem of clustering privately a dataset in ℝ^d that un...
share
research
∙
11/15/2022
Improved Coresets for Euclidean k-Means
Given a set of n points in d dimensions, the Euclidean k-means problem (...
research
∙
06/17/2022
Scalable Differentially Private Clustering via Hierarchically Separated Trees
We study the private k-median and k-means clustering problem in d dimens...
research
∙
02/25/2022
Towards Optimal Lower Bounds for k-median and k-means Coresets
Given a set of points in a metric space, the (k,z)-clustering problem co...
research
∙
11/08/2021
An Improved Local Search Algorithm for k-Median
We present a new local-search algorithm for the k-median clustering prob...
research
∙
04/13/2021
A New Coreset Framework for Clustering
Given a metric space, the (k,z)-clustering problem consists of finding k...
research
∙
06/23/2020
Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs
We study clustering problems such as k-Median, k-Means, and Facility Loc...
research
∙
01/28/2019
Dominating Sets and Connected Dominating Sets in Dynamic Graphs
In this paper we study the dynamic versions of two basic graph problems:...
research
∙
12/20/2018
