Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [1]	Hilfe

Suche: Author="Rodr{\'{i}}uez-Ch{\'{i}}a, A.M."

Journal of Algorithms 56 (1), 2005, pp. 50-75

Editors		Zvi Galil, David S. Johnson, Donald E. Knuth
Publisher:		Elsevier B.V.
Address:		Orlando-Amsterdam-Tokyo-Singapore
Keywords:		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. (Copyright 2005 ScienceDirect)
URL:		http://dx.doi.org/10.1016/j.jalgor.2005.01.005