Detailed Information
Cited 2 time in 
Cited 2 time in 
Cited 2 time in
Metadata Downloads
Linear-Time Algorithm for the Length-Constrained Heaviest Path Problem in a Tree with Uniform Edge Lengthsopen access
- Authors
- Kim, Sung Kwon
- Issue Date
- Mar-2013
- Publisher
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
- Keywords
- length-constrained paths; heaviest paths; uniform edge lengths
- Citation
- IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E96D, no.3, pp 498 - 501
- Pages
- 4
- Journal Title
- IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
- Volume
- E96D
- Number
- 3
- Start Page
- 498
- End Page
- 501
- ISSN
- 0916-8532
- Abstract
- Given a tree T with edge lengths and edge weights, and a value B, the length-constrained heaviest path problem is to find a path in T with maximum path weight whose path length is at most B. We present a linear time algorithrn for the problem when the edge lengths are uniform, i.e., all one. This algorithm with slight modification can be used to find the heaviest path of length exactly B in T in linear time.
- Files in This Item
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.