Lukas Drexler

collaborators

Showing cs.DSShow all

4 papers · 1 filter

cs.DS2024

FPT Approximations for Fair $k$ -Min-Sum-Radii

Lena Carta, Lukas Drexler, Annika Hennes +2

We consider the $k$ -min-sum-radii ( $k$ -MSR) clustering problem with fairness constraints. The $k$ -min-sum-radii problem is a mixture of the classical $k$ -center and $k$ -median prob…

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 $k$ -means clustering has been extensively studied and has undergone several improvements. While in its original form it does n…

cs.DS2023

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 $k \in N$ as well as some metric space $(V, d)$ where $V = F \cup C$ for facilities…

cs.DS2023

Approximating Fair $k$ -Min-Sum-Radii in Euclidean Space

Lukas Drexler, Annika Hennes, Abhiruk Lahiri +2

The $k$ -center problem is a classical clustering problem in which one is asked to find a partitioning of a point set $P$ into $k$ clusters such that the maximum radius of any clust…

FPT Approximations for Fair k-Min-Sum-Radii

Local Search k-means++ with Foresight

Clustering Graphs of Bounded Treewidth to Minimize the Sum of Radius-Dependent Costs

Approximating Fair k-Min-Sum-Radii in Euclidean Space

FPT Approximations for Fair $k$ -Min-Sum-Radii

Approximating Fair $k$ -Min-Sum-Radii in Euclidean Space