7 citations · 17 across the 19 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
An Improved Local Search Algorithm for k-Median
Vincent Cohen-Addad, Anupam Gupta, Lunjia Hu +2
We present a new local-search algorithm for the -median clustering problem. We show that local optima for this algorithm give a -approximation; our result improves up…
cs.DS2021
A New Coreset Framework for Clustering
Vincent Cohen-Addad, David Saulpic, Chris Schwiegelshohn
Given a metric space, the -clustering problem consists of finding centers such that the sum of the of distances raised to the power of every point to its closest cen…