Abstract
In this paper, an optimal algorithm to solve the continuous/discrete weighted 2-center problem is proposed. The method generalizes the "trimming" technique of Megiddo [5] in a nontrivial way, This result allows an improved O(n log n) time algorithm for the weighted 3-center and 4-center problems. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Ben-Moshe, B., Bhattacharya, B., & Shi, Q. (2006). An optimal algorithm for the continuous/discrete weighted 2-center problem in trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3887 LNCS, pp. 166–177). https://doi.org/10.1007/11682462_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
