1 citations · 1 across the 3 of their papers we have counts for
5 papers · 1 filter
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…
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…
Clustering Graphs of Bounded Treewidth to Minimize the Sum of Radius-Dependent Costs
Lukas Drexler, Jan Höckendorff, Joshua Könen +1
We consider the following natural problem that generalizes min-sum-radii clustering: Given is as well as some metric space where for facilities…
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…
Connected k-Center and k-Diameter Clustering
Lukas Drexler, Jan Eube, Kelin Luo +4
Motivated by an application from geodesy, we introduce a novel clustering problem which is a -center (or k-diameter) problem with a side constraint. For the side constraint, we…