An Approximation Algorithm for Maximum Internal Spanning Tree.
Zhi-Zhong ChenYouta HaradaLusheng WangPublished in: CoRR (2016)
Keyphrases
- spanning tree
- minimum spanning tree
- learning algorithm
- dynamic programming
- preprocessing
- optimal solution
- error tolerance
- approximation ratio
- knapsack problem
- closed form
- detection algorithm
- expectation maximization
- simulated annealing
- shortest path
- segmentation method
- undirected graph
- k means
- objective function
- minimum weight
- genetic algorithm