research
∙
07/22/2022
Correlation Clustering with Sherali-Adams
Given a complete graph G = (V, E) where each edge is labeled + or -, the...
share
research
∙
03/02/2022
Near-Optimal Correlation Clustering with Privacy
Correlation clustering is a central problem in unsupervised learning, wi...
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
∙
04/24/2019
A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs
We consider the classic Facility Location problem on planar graphs (non-...
research
∙
06/21/2018
