Combining the above theorem with the known \((1+\frac{2}{e}+\epsilon )\) -approximation \(k\) -median algorithm of Cohen-Addad et al. [1]} that runs in \((k/\epsilon )^{O(k)} \cdot n^{O(1)}\)  time, we directly have the following result.
