Constrained k k -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 k k -center problem, arising from a geometric clientserver problem. The second is the problem of moving points towards an independent set.
approximation algorithm clientserver problem independent set computational geometry fixed parameter tractable algorithm linear programming