Optimal algorithms for the path/tree-shaped facility location problems in trees

Authors:
Binay Bhattacharya;Yuzhuang Hu;Qiaosheng Shi;Arie Tamir
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada;School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada;School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada;School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel
Venue:
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Year:
2006

Citing 5
Cited 1

An O(n) algorithm for the linear multiple choice knapsack problem and related problems

Information Processing Letters
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
Conditional location of path and tree shaped facilities on trees

Journal of Algorithms
An optimal algorithm for the continuous/discrete weighted 2-center problem in trees

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

The connected p-center problem on block graphs with forbidden vertices

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the problem of locating a path-shaped or tree-shaped (extensive) facility in trees under the condition that existing facilities are already located. We introduce a parametric-pruning method to solve the conditional extensive weighted 1-center location problems in trees in linear time. This improves the recent results of O(n logn) by Tamir et al. [16].