5 citations · 5 across the 7 of their papers we have counts for
1 paper · 1 filter
Vincent Cohen-Addad, Andrew Draganov, Matteo Russo +2
We consider coresets for k-clustering problems, where the goal is to assign points to centers minimizing powers of distances. A popular example is the k-median objective $\sum_…