A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem.
Daniel Binkele-RaibleHenning FernauPublished in: CSR (2010)
Keyphrases
- learning algorithm
- improved algorithm
- cost function
- experimental evaluation
- search space
- dynamic programming
- preprocessing
- simulated annealing
- computational complexity
- brute force
- times faster
- objective function
- linear programming
- k means
- highly efficient
- selection algorithm
- classification algorithm
- optimization algorithm
- segmentation algorithm
- worst case
- optimal solution
- np hard
- significant improvement
- evolutionary algorithm
- input data
- data sets
- tree structure
- convergence rate
- recognition algorithm
- image segmentation
- spanning tree
- memory efficient