
Efficient algorithms for the one-dimensional k-center problem
Keywords: هندسه محاسباتی; k-center; One-dimension; Facility locations; Algorithms; Data structures; 2-D sublist LP queries; Computational geometry