Abstract
An optimal linear time algorithm for the unweighted p-center problems in trees has been known since 1991 [4]. No such worst-case linear time result is known for the weighted version of the p-center problems, even for a path graph. In this paper, for fixed p, we propose two linear-time algorithms for the weighted p-center problem for points on the real line, thereby partially resolving a long-standing open problem. One of our approaches generalizes the trimming technique of Megiddo [10], and the other one is based on the parametric pruning technique, introduced here. The proposed solutions make use of the solutions of another variant of the center problem called the conditional center location problem [13].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ben-Moshe, B., Bhattacharya, B., Shi, Q.: An optimal algorithm for the continuous/discrete weighted 2-center problem in trees. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 166–177. Springer, Heidelberg (2006)
Blum, M., Floyd, R.W., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Sys. Sci. 7, 448–461 (1972)
Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34, 200–208 (1987)
Frederickson, G.N.: Parametric search and locating supply centers in trees. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol. 519, pp. 299–319. Springer, Heidelberg (1991)
Halman, N.: Discrete and lexicographic Helly theorems and their relations to LP-type problems. Ph.D. Thesis, Tel. Aviv. Univ. (2004)
Halman, N.: On the power of discrete and lexicographic Helly-type theorems. in 45th FOCS, pp. 463–472 (2004)
Hassin, R., Tamir, A.: Improved complexity bounds for location problems on the real line. Oper. Res. Let. 10, 395–402 (1992)
Jeger, M., Kariv, O.: Algorithms for finding p-centers on a weighted tree (for relatively small p). Networks 15, 381–389 (1985)
Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, Part I. The p-centers. SIAM J. Appl. Math. 37, 513–538 (1979)
Megiddo, N.: Linear-time algorithms for linear programming in R 3 and related problems. SIAM J. Comput. 12(4), 759–776 (1983)
Megiddo, N., Tamir, A., Zemel, E., Chandrasekaran, R.: An O(n log2 n) algorithm for the kth longest path in a tree with applications to location problems. SIAM J. Comput. 10(2), 328–337 (1981)
Megiddo, N., Tamir, A.: New results on the complexity of p-center problems. SIAM J. Comput. 12(4), 751–758 (1983)
Minieka, E.: Conditional centers and medians on a graph. Networks 10, 265–272 (1980)
Zemel, E.: An O(n) algorithm for the linear multiple choice knapsack problem and related problems. Info. Proc. Let. 18, 123–128 (1984)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhattacharya, B., Shi, Q. (2007). Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p . In: Dehne, F., Sack, JR., Zeh, N. (eds) Algorithms and Data Structures. WADS 2007. Lecture Notes in Computer Science, vol 4619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73951-7_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-73951-7_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73948-7
Online ISBN: 978-3-540-73951-7
eBook Packages: Computer ScienceComputer Science (R0)