3 citations · 3 across the 2 of their papers we have counts for
1 paper · 1 filter
Fateme Abbasi, Sandip Banerjee, Jarosław Byrka +6
This paper considers the well-studied algorithmic regime of designing a (1+ε)-approximation algorithm for a k-clustering problem that runs in time f(k,ε)poly(n) (sometimes ca…