We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the kcenter problem, arising from a geometric client-server problem. The second is the problem of moving points towards an independent set.
Dumitrescu and Jiang REF obtained hardness results and approximation algorithms for two related geometric problems involving movement.
Constrained k-center and movement to independence
CCCG
Mathematics Computer Science