| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421264 | Discrete Applied Mathematics | 2011 | 7 Pages |
Abstract
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the kk-center problem, arising from a geometric client–server problem. The second is the problem of moving points towards an independent set.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Adrian Dumitrescu, Minghui Jiang,