Showing cs.DSShow all
3 papers · 1 filter
cs.DS2024
FPT Approximations for Fair -Min-Sum-Radii
Lena Carta, Lukas Drexler, Annika Hennes +2
We consider the -min-sum-radii (-MSR) clustering problem with fairness constraints. The -min-sum-radii problem is a mixture of the classical -center and -median prob…
cs.DS2024
Approximating Fair -Min-Sum-Radii in Euclidean Space
Lukas Drexler, Annika Hennes, Abhiruk Lahiri +2
The -center problem is a classical clustering problem in which one is asked to find a partitioning of a point set into clusters such that the maximum radius of any clust…
cs.DS2024
Local Search k-means++ with Foresight
Theo Conrads, Lukas Drexler, Joshua Könen +2
Since its introduction in 1957, Lloyd's algorithm for -means clustering has been extensively studied and has undergone several improvements. While in its original form it does n…