THE TREE CENTER PROBLEMS AND THE RELATIONSHIP WITH THE BOTTLENECK KNAPSACK-PROBLEMS

Authors
SHIOURA A SHIGENO M
Citation
A. Shioura et M. Shigeno, THE TREE CENTER PROBLEMS AND THE RELATIONSHIP WITH THE BOTTLENECK KNAPSACK-PROBLEMS, Networks, 29(2), 1997, pp. 107-110
Citations number
8
Categorie Soggetti
Computer Sciences","Computer Science Hardware & Architecture
Journal title
Networks → ACNP
ISSN journal
00283045
Volume
29
Issue
2
Year of publication
1997
Pages
107 - 110
Database
ISI
SICI code
0028-3045(1997)29:2<107:TTCPAT>2.0.ZU;2-0
Abstract
The tree center problems are designed to find a subtree minimizing the maximum distance from any vertex. This paper shows that these problem s in a tree network are related to the bottleneck knapsack problems an d presents linear-time algorithms for the tree center problems by usin g the relation. (C) 1997 John Wiley & Sons, Inc.