Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity

Robert Ganian, Hung P. Hoang, Simon Wietheger

We study the computational problem of computing a fair means clustering of discrete vectors, which admits an equivalent formulation as editing a colored matrix into one with few di…