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

Akiyoshi Shioura, Maiko Shigeno

研究成果: Article査読

13 被引用数 (Scopus)

抄録

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

引用スタイル