Constrained k-center and movement to independence.
Adrian Dumitrescu, Minghui Jiang · 2010
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising from a geometric client-server problem. The second is the problem of moving points towards an independent set. 1 1