1 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.DS2023★ 1 cited
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.DS2022
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…
cs.DS2021★ 1 cited
Coresets for constrained k-median and k-means clustering in low dimensional Euclidean space
Melanie Schmidt, Julian Wargalla
We study (Euclidean) -median and -means with constraints in the streaming model. There have been recent efforts to design unified algorithms to solve constrained -means pr…