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. 
DOI: 10.1016/j.dam.2011.01.008


3 Figures and Tables

Slides referencing similar topics