Vincent Cohen-Addad

A \({(2+\varepsilon )}\)-Approximation Algorithm for Metric \({k}\)-Median

Abstract. In the classical NP-hard (metric) [Formula: see text]-median problem, we are given a set of [Formula: see text] clients and centers with metric distances between them, along with an integer parameter [Formula: see text]. The objective is to select a subset of [Formula:...