In this paper we consider the problem of locating a path-shaped or tree-shaped (extensive) facility in trees under the condition that existing facilities are already located. We introduce a parametric-pruning method to solve the conditional extensive weighted 1-center location problems in trees in linear time. This improves the recent results of O(n logn) by Tamir et al. [16]. © 2006 Springer-Verlag Berlin/Heidelberg.
CITATION STYLE
Bhattacharya, B., Hu, Y., Shi, Q., & Tamir, A. (2006). Optimal algorithms for the path/tree-shaped facility location problems in trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4288 LNCS, pp. 379–388). https://doi.org/10.1007/11940128_39
Mendeley helps you to discover research relevant for your work.