A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem.
Marshall L. FisherPublished in: Oper. Res. (1994)
Keyphrases
- tree structure
- optimization algorithm
- learning algorithm
- detection algorithm
- optimal solution
- preprocessing
- times faster
- k means
- expectation maximization
- mining high utility itemsets
- graph structure
- simulated annealing
- objective function
- computational complexity
- dynamic programming
- linear programming
- pruning algorithm
- recognition algorithm
- cost function
- input data
- search space
- np hard
- segmentation algorithm
- minimum spanning tree
- computational cost
- low degree
- square error
- polynomially bounded