Constrained kk-center and movement to independence

We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the kk-center problem, arising from a geometric client–server problem. The second is the problem of moving points towards an independent set.