TY - GEN
T1 - Computing the line-constrained k-center in the plane for small k
AU - Huang, Albert Jhih Heng
AU - Wang, Hung Lung
AU - Chao, Kun Mao
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2016.
PY - 2016
Y1 - 2016
N2 - In this paper, we study the line-constrained k-center problem in the Euclidean plane. Given a set of demand points and a line L, the problem asks for k points, called center facilities, on L, such that the maximum of the distances from the demand points to their closest center facilities is minimized. For any fixed k, we propose an algorithm with running time linear to the number of demand points.
AB - In this paper, we study the line-constrained k-center problem in the Euclidean plane. Given a set of demand points and a line L, the problem asks for k points, called center facilities, on L, such that the maximum of the distances from the demand points to their closest center facilities is minimized. For any fixed k, we propose an algorithm with running time linear to the number of demand points.
UR - https://www.scopus.com/pages/publications/84978285807
UR - https://www.scopus.com/pages/publications/84978285807#tab=citedBy
U2 - 10.1007/978-3-319-41168-2_17
DO - 10.1007/978-3-319-41168-2_17
M3 - Conference contribution
AN - SCOPUS:84978285807
SN - 9783319411675
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 197
EP - 208
BT - Algorithmic Aspects in Information and Management - 11th International Conference, AAIM 2016, Proceedings
A2 - Dondi, Riccardo
A2 - Mauri, Giancarlo
A2 - Fertin, Guillaume
PB - Springer Verlag
T2 - 11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016
Y2 - 18 July 2016 through 20 July 2016
ER -