Constrained 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-center problem, arising from a geometric client-server problem. The second is the problem of moving points towards an independent set.

• Type: Conference
• Year: 2010
• Where: CCCG
• Authors: Adrian Dumitrescu, Minghui Jiang
• Keywords: CCCG 2010, Computational Geometry, Geometric Client-server Problem, K-center Problem, Related Geometric Problems