… by extending the basic k-center problem to include a minimum coverage requirement. We
allow coverage by different cen… In the problem, we minimize distances as in the basic k-center …

… minimum set cover problem. We apply the algorithm in heuristic solving the minimum k-center
problem … of 40 test problems we experimentally show that our k-center algorithm performs …

… Since |Ci| ≤ α · 2i, we can open a ball at every point in Ci; furthermore, since j < 2i, we have
rj ≥ ̂ri and so we cover whatever the balls from ̂S covered. Finally, we also open the α …

… In the q-cover k-center problem each set must cover at least q non-center nodes. We can
therefore not use the algorithm from the previous section, as the centers here only are …

… problem instead of the set cover problem [7].) For example, Minieka [10] solved the k-center
problem as a series of set cover problems… [2,3], where also the maximum cover problem was …

… a variation of this problem as well, called the -all-neighbor K-center problem that is …
covered by at least j centers. We assign a center at the chosen vertex, and increase the covering …

… In section 2 we discuss a simplification of the problem where a … refer to this problem as the
capacitated multi-K-center problem. By … to a solution to the set cover problem using K − 1 sets. …

… problems. Two recently introduced variants of the k-Center problem in this spirit are Colorful
k-Center, … models, such as the Fair Robust k-Center problem introduced by Harris, Pensyl, …

… of the k-Center problem in this spirit are Colorful k-Center, … as the Fair Robust k-Center problem
introduced by Harris, … to traditional k-Center, include additional covering constraints. Prior …

… , since j < 2i , we have rj ≥ ̂ri and so we cover whatever the balls from ̂S covered. … NUkC
problem that generalizes the classic k-center problem and the k-center with outlier problem. …