Journal article
The location of central structures in trees
Computers & operations research, Vol.15(2), pp.103-113
1988
DOI: 10.1016/0305-0548(88)90003-2
Abstract
A nonlinear version of the path center location problem is analyzed. We introduce a closely related problem called the subtree location problem. Variants in which the endpoints of the central structure to be located may or may not be restricted to the vertex set are also studied. We give theoretical results for the nonlinear cases when the underlying structure is a tree with edges of varying length and linear time algorithms for the unweighted vertex case. The linear time algorithms have their basis in an efficient data structures for representing trees.
Details
- Title: Subtitle
- The location of central structures in trees
- Creators
- Rex K. Kincaid - Department of Mathematics, College of William and Mary, Williamsburg, VA23185 U.S.ATimothy J. Lowe - Purdue University West LafayetteThomas L. Morin - Purdue University West Lafayette
- Resource Type
- Journal article
- Publication Details
- Computers & operations research, Vol.15(2), pp.103-113
- DOI
- 10.1016/0305-0548(88)90003-2
- ISSN
- 0305-0548
- eISSN
- 1873-765X
- Publisher
- Elsevier Ltd
- Number of pages
- 11
- Language
- English
- Date published
- 1988
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963223502771
Metrics
1 Record Views