A technique for obtaining true approximations for k-center with covering constraints

. Moreover, under the Exponential Time Hypothesis, the problem is inapproximable if the number of colors grows faster than logarithmic in the size of the ground set.