Geometric p-center problems with centers constrained to two lines
Document Type
Conference Article
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Abstract
We first consider the weighted p-center problem, in which the centers are constrained to lie on two axis-parallel lines. Given a set of n points in the plane, which are sorted according to their x-coordinates, we show how to test in O(n log n) time if p piercing points placed on two lines, parallel to the x-axis, can pierce all the disks of different radii centered at the n given points. This leads to an O(n log2 n) time algorithm for the weighted p-center problem.We then consider the unweighted case, where the centers are constrained to be on two perpendicular lines. Our algorithm runs in O(n log2 n) time in this case as well.
First Page
24
Last Page
36
DOI
10.1007/978-3-319-48532-4_3
Publication Date
1-1-2016
Recommended Citation
Bhattacharya, Binay; Ćustić, Ante; Das, Sandip; Higashikawa, Yuya; Kameda, Tsunehiko; and Katoh, Naoki, "Geometric p-center problems with centers constrained to two lines" (2016). Conference Articles. 722.
https://digitalcommons.isical.ac.in/conf-articles/722
