The tree center problems and the relationship with the bottleneck knapsack problems

The tree center problems and the relationship with the bottleneck knapsack problems

0.00 Avg rating0 Votes
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: ,
Keywords: knapsack problem
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.