1 citations · 4 across the 11 of their papers we have counts for
5 papers · 1 filter
Almost Optimal Fully Dynamic -Center Clustering with Recourse
Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad +2
In this paper, we consider the \emph{metric -center} problem in the fully dynamic setting, where we are given a metric space evolving via a sequence of point insertions…
Fully Dynamic -Clustering with Fast Update Time and Small Recourse
Sayan Bhattacharya, Martín Costa, Naveen Garg +2
In the dynamic metric -median problem, we wish to maintain a set of centers in an input metric space that gets updated via point insertions/deletion…
Dynamic Correlation Clustering in Sublinear Update Time
Vincent Cohen-Addad, Silvio Lattanzi, Andreas Maggiori +1
We study the classic problem of correlation clustering in dynamic node streams. In this setting, nodes are either added or randomly deleted over time, and each node pair is connect…
Multi-View Stochastic Block Models
Vincent Cohen-Addad, Tommaso d'Orsi, Silvio Lattanzi +1
Graph clustering is a central topic in unsupervised learning with a multitude of practical applications. In recent years, multi-view graph clustering has gained a lot of attention…
A Scalable Algorithm for Individually Fair K-means Clustering
MohammadHossein Bateni, Vincent Cohen-Addad, Alessandro Epasto +1
We present a scalable algorithm for the individually fair (, )-clustering problem introduced by Jung et al. and Mahabadi et al. Given points in a metric space, let $δ…