Center location problems on tree graphs with subtree-shaped customers

J. Puerto, A. Tamir, J. A. Mesa, D. Pérez-Brito

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)2890-2910
Number of pages21
JournalDiscrete Applied Mathematics
Volume156
Issue number15
DOIs
StatePublished - 6 Aug 2008

Keywords

  • Facility location
  • Subtree-shaped customers
  • Tree graphs

Fingerprint

Dive into the research topics of 'Center location problems on tree graphs with subtree-shaped customers'. Together they form a unique fingerprint.

Cite this