A More Efficient Reduction from Outlier-Aware to Outlier-Free k-Median

Given a non-negative integer ℓ, the k-median with outliers problem extends the standard k-median problem by allowing the removal of up to ℓ points and minimizing the clustering cost over the remaining ones. Algorithmic development in this setting remains an active area of research due to its relevance in processing noisy data. In this paper, we present a sampling-based reduction from the k-median with outliers problem to its outlier-free counterpart. The reduction incurs a multiplicative overhead of (kℓ -1 + ε -1 ) O(ℓ) in the running time: it yields (kℓ -1 + ε -1 ) O(ℓ) outlier-free instances, a solution to one of which can be directly transformed into a solution to the original instance with an arbitrarily small loss in the approximation ratio. This improves upon the previously known reduction with an overhead of ((k + ℓ)ε -1 ) O(ℓ) . As applications, we obtain faster fixedparameter tractable (FPT) algorithms with tight approximation guarantees for the k-median with outliers problem under various metric spaces. Furthermore, our approach naturally generalizes to constrained variants of the problem where additional constraints are imposed on the cluster sizes, and yields similar improvements in their FPT approximations.