Linear-Time Algorithm for the Length-Constrained Heaviest Path Problem in a Tree with Uniform Edge Lengths.
Sung Kwon KimPublished in: IEICE Trans. Inf. Syst. (2013)
Keyphrases
- dynamic programming
- worst case
- preprocessing
- tree structure
- learning algorithm
- cost function
- computational cost
- detection algorithm
- minimum length
- optimal path
- k means
- path planning
- root node
- undirected graph
- convergence rate
- segmentation algorithm
- search space
- convex hull
- edge information
- lower bound
- path finding
- binary tree
- tree construction
- objective function
- decision trees