An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree.
Q. S. WuChin Lung LuRichard C. T. LeePublished in: ISAAC (2000)
Keyphrases
- hamiltonian path
- dynamic programming
- learning algorithm
- experimental evaluation
- computational cost
- piecewise linear
- tree structure
- binary tree
- np hard
- search space
- preprocessing
- computational complexity
- tree construction
- times faster
- detection algorithm
- significant improvement
- theoretical analysis
- linear programming
- optimization algorithm
- minimum spanning tree
- clustering method
- optimal solution
- graph theoretic
- spanning tree
- segmentation algorithm
- recognition algorithm
- convergence rate
- metaheuristic
- worst case
- probabilistic model
- cost function
- objective function