Conditional location of path and tree shaped facilities on trees

Authors:
A. Tamir;J. Puerto;J. A. Mesa;A. M. Rodríguez-Chía
Affiliations:
School of Mathematical Sciences, Tel Aviv University, Israel;Facultad de Matemáticas, Universidad de Sevilla, Spain;Escuela Técnica Superior de Ingenieros, Universidad de Sevilla, Spain;Facultad de Ciencias, Universidad de Cádiz, Spain
Venue:
Journal of Algorithms
Year:
2005

Citing 11
Cited 2

Finding the upper envelope of n line segments in O(n log n) time

Information Processing Letters
Algorithms for a core and k-tree core of a tree

Journal of Algorithms
On the conditional p-median problem

Computers and Operations Research
Efficient algorithms for finding a core of a tree with a specified length

Journal of Algorithms
Davenport-Schinzel sequences and their geometric applications

Davenport-Schinzel sequences and their geometric applications
Fully polynomial approximation schemes for locating a tree-shaped facility: a generalization of the knapsack problem

Discrete Applied Mathematics
Algorithms for path medi-centers of a tree

Computers and Operations Research - location science
Efficient parallel algorithms for optimally locating a path and a tree of a specified length in a weighted tree network

Journal of Algorithms
The Centdian subtree on tree networks

Discrete Applied Mathematics
Finding a 2-Core of a Tree in Linear Time

SIAM Journal on Discrete Mathematics
Finding Cores of Limited Length

WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures

Finding the conditional location of a median path on a tree

Information and Computation
Extensive facility location problems on networks with equity measures

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.