Lukas Drexler

activity

20222024

k

-Min-Sum-Radii in Euclidean Space

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

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★ 1 cited

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…

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

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

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