1 citations · 1 across the 1 of their papers we have counts for
3 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…
On the cost of essentially fair clusterings
Ioana O. Bercea, Martin Groß, Samir Khuller +4
Clustering is a fundamental tool in data mining. It partitions points into groups (clusters) and may be used to make decisions for each point based on its group. However, this proc…
Smoothed Analysis of the Successive Shortest Path Algorithm
Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey +2
The minimum-cost flow problem is a classic problem in combinatorial optimization with various applications. Several pseudo-polynomial, polynomial, and strongly polynomial algorithm…