@article{b482c41530dd4050b8a40699b55ea4b0,
title = "Center location problems on tree graphs with subtree-shaped customers",
abstract = "We consider the p-center problem on tree graphs where the customers are modeled as continua subtrees. We address unweighted and weighted models as well as distances with and without addends. We prove that a relatively simple modification of Handler's classical linear time algorithms for unweighted 1- and 2-center problems with respect to point customers, linearly solves the unweighted 1- and 2-center problems with addends of the above subtree customer model. We also develop polynomial time algorithms for the p-center problems based on solving covering problems and searching over special domains.",
keywords = "Facility location, Subtree-shaped customers, Tree graphs",
author = "J. Puerto and A. Tamir and Mesa, {J. A.} and D. P{\'e}rez-Brito",
note = "Funding Information: This work started during a visit of the second author to the University of Seville. It was partially supported by research grants of the Spanish Ministry of Science and Education BFM2002-10418, MTM2006-15054, MTM2004-0909 and the Andalusian Consejeria de Innovaci{\'o}n Ciencia y Empresa FQM-331 and P06-FQM-01366.",
year = "2008",
month = aug,
day = "6",
doi = "10.1016/j.dam.2007.11.022",
language = "אנגלית",
volume = "156",
pages = "2890--2910",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "15",
}