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

Akiyoshi Shioura, Maiko Shigeno

Research output: Contribution to journalArticlepeer-review

14 Citations (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.

Original languageEnglish
Pages (from-to)107-110
Number of pages4
Issue number2
Publication statusPublished - 1997 Jan 1

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this