1 citations · 1 across the 1 of their papers we have counts for
5 papers
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…
Privacy preserving clustering with constraints
Clemens Rösner, Melanie Schmidt
The -center problem is a classical combinatorial optimization problem which asks to find centers such that the maximum distance of any input point in a set to its assign…
New Deterministic Algorithms for Solving Parity Games
Matthias Mnich, Heiko Röglin, Clemens Rösner
We study parity games in which one of the two players controls only a small number of nodes and the other player controls the other nodes of the game. Our main result is…
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…