Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs.
Krzysztof LorysGrazyna ZwozniakPublished in: ESA (2002)
Keyphrases
- dynamic programming
- learning algorithm
- spanning tree
- minimum spanning tree
- detection algorithm
- computational complexity
- probabilistic model
- preprocessing
- computational cost
- optimization algorithm
- error tolerance
- matching algorithm
- optimal solution
- segmentation algorithm
- particle swarm optimization
- simulated annealing
- worst case
- cost function
- significant improvement
- graph construction
- approximation ratio
- graph isomorphism
- convergence rate
- closed form
- tree structure
- theoretical analysis
- knn
- association rules
- objective function