The p-center problem in tree networks revisited
Document Type
Conference Article
Publication Title
Leibniz International Proceedings in Informatics, LIPIcs
Abstract
We present two improved algorithms for weighted discrete p-center problem for tree networks with n vertices. One of our proposed algorithms runs in O(n log n + p log2 n log(n/p)) time. For all values of p, our algorithm thus runs as fast as or faster than the most efficient O(n log2 n) time algorithm obtained by applying Cole's speed-up technique [10] to the algorithm due to Megiddo and Tamir [20], which has remained unchallenged for nearly 30 years. Our other algorithm, which is more practical, runs in O(n log n + p2 log2 (n/p)) time, and when p = O(√ n) it is faster than Megiddo and Tamir's O(n log2 n log log n) time algorithm [20].
First Page
6.1
Last Page
6.15
DOI
10.4230/LIPIcs.SWAT.2016.6
Publication Date
6-1-2016
Recommended Citation
Banik, Aritra; Bhattacharya, Binay; Das, Sandip; Kameda, Tsunehiko; and Song, Zhao, "The p-center problem in tree networks revisited" (2016). Conference Articles. 806.
https://digitalcommons.isical.ac.in/conf-articles/806
