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.
|Number of pages||4|
|Publication status||Published - 1997 Jan 1|
ASJC Scopus subject areas
- Information Systems
- Hardware and Architecture
- Computer Networks and Communications