抄録
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.
| 本文言語 | English |
|---|---|
| ページ（範囲） | 107-110 |
| ページ数 | 4 |
| ジャーナル | Networks |
| 巻 | 29 |
| 号 | 2 |
| DOI | |
| 出版ステータス | Published - 1997 1 1 |
ASJC Scopus subject areas
- Software
- Information Systems
- Hardware and Architecture
- Computer Networks and Communications