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

Akiyoshi Shioura; Maiko Shigeno

doi:10.1002/(SICI)1097-0037(199703)29:2<107::AID-NET4>3.0.CO;2-N

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

Akiyoshi Shioura, Maiko Shigeno

INF - System Information Sciences

Research output: Contribution to journal › Article › peer-review

16 Citations (Scopus)

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.

Original language	English
Pages (from-to)	107-110
Number of pages	4
Journal	Networks
Volume	29
Issue number	2
DOIs	https://doi.org/10.1002/(SICI)1097-0037(199703)29:2<107::AID-NET4>3.0.CO;2-N
Publication status	Published - 1997 Jan 1

ASJC Scopus subject areas

Software
Information Systems
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1002/(SICI)1097-0037(199703)29:2<107::AID-NET4>3.0.CO;2-N

Cite this

@article{bf5c048358a8431e817b51b60cde8336,

title = "The tree center problems and the relationship with the bottleneck knapsack problems",

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.",

author = "Akiyoshi Shioura and Maiko Shigeno",

year = "1997",

month = jan,

day = "1",

doi = "10.1002/(SICI)1097-0037(199703)29:2<107::AID-NET4>3.0.CO;2-N",

language = "English",

volume = "29",

pages = "107--110",

journal = "Networks",

issn = "0028-3045",

publisher = "Wiley-Liss Inc.",

number = "2",

}

TY - JOUR

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

AU - Shioura, Akiyoshi

AU - Shigeno, Maiko

PY - 1997/1/1

Y1 - 1997/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0040007564&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0040007564&partnerID=8YFLogxK

U2 - 10.1002/(SICI)1097-0037(199703)29:2<107::AID-NET4>3.0.CO;2-N

DO - 10.1002/(SICI)1097-0037(199703)29:2<107::AID-NET4>3.0.CO;2-N

M3 - Article

AN - SCOPUS:0040007564

SN - 0028-3045

VL - 29

SP - 107

EP - 110

JO - Networks

JF - Networks

IS - 2

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this