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 distinct color-balanced rows by changing at most k values. While NP-hard in both the fairness-oblivious and the fair settings, the problem is well-known to admit a fixed-parameter algorithm in the former ``vanilla'' setting. As our first contribution, we exclude an analogous algorithm even for highly restricted fair means clustering instances. We then proceed to obtain a full complexity landscape of the problem, and establish tractability results which capture three means of circumventing our obtained lower bound: placing additional constraints on the problem instances, fixed-parameter approximation, or using an alternative parameterization targeting tree-like matrices.
@article{arxiv.2512.03718,
title = {Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity},
author = {Robert Ganian and Hung P. Hoang and Simon Wietheger},
journal= {arXiv preprint arXiv:2512.03718},
year = {2025}
}