Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10332407 | Journal of Algorithms | 2005 | 26 Pages |
Abstract
In this paper we deal with the location of extensive facilities on trees, both discrete and continuous, under the condition that existing facilities are already located. We require that the selected new server is a subtree, although we also specialize to the case of paths. We study the problem with the two most widely used criteria in Location Analysis: center and median. Our main results under the center criterion are nestedness properties of the solution and subquadratic algorithms for the location of paths and subtrees. For the case of the median criterion we prove that unlike the case where there is no existing facility, the continuous conditional median subtree problem is NP-hard and we develop a corresponding fully polynomial approximation algorithm. We also present subquadratic algorithms for almost all other models.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
A. Tamir, J. Puerto, J.A. Mesa, A.M. RodrÃguez-ChÃa,