Algorithms for Computing k-centers on the Line

This paper considers variants of k-center problems to find the set of disks with centers on a given (or moving) line with fixed orientation such that the disks contain a given point set and the maximum radius of the disks is minimized.