Article ID: | iaor2002394 |
Country: | United States |
Volume: | 29 |
Issue: | 2 |
Start Page Number: | 107 |
End Page Number: | 110 |
Publication Date: | Mar 1997 |
Journal: | Networks |
Authors: | Shigeno Maiko, Shioura Akiyoshi |
Keywords: | knapsack problem |
The tree center problems are designed to find a subtree minimizing the maximum distance from any vertex. This paper shows that these problems in a tree network are related to the bottleneck knapsack problems and presents linear-time algorithms for the tree center problems by using the relation.