4 papers
A Simple Combinatorial Algorithm for Robust Matroid Center
Georg Anegg, Laura Vargas Koch, Rico Zenklusen
Recent progress on robust clustering led to constant-factor approximations for Robust Matroid Center. After a first combinatorial -approximation that is based on a matroid inter…
Techniques for Generalized Colorful -Center Problems
Georg Anegg, Laura Vargas Koch, Rico Zenklusen
Fair clustering enjoyed a surge of interest recently. One appealing way of integrating fairness aspects into classical clustering problems is by introducing multiple covering const…
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture
Georg Anegg, Haris Angelidakis, Rico Zenklusen
A well-known conjecture of Füredi, Kahn, and Seymour (1993) on non-uniform hypergraph matching states that for any hypergraph with edge weights , there exists a matching suc…
A Technique for Obtaining True Approximations for -Center with Covering Constraints
Georg Anegg, Haris Angelidakis, Adam Kurpisz +1
There has been a recent surge of interest in incorporating fairness aspects into classical clustering problems. Two recently introduced variants of the -Center problem in this s…