A 43-approximation algorithm for the Maximum Internal Spanning Tree Problem.
Xingfu LiDaming ZhuLusheng WangPublished in: J. Comput. Syst. Sci. (2021)
Keyphrases
- learning algorithm
- detection algorithm
- preprocessing
- optimal solution
- computational cost
- experimental evaluation
- dynamic programming
- recognition algorithm
- closed form
- optimization algorithm
- simulated annealing
- k means
- cost function
- objective function
- input data
- expectation maximization
- data sets
- theoretical analysis
- similarity measure
- improved algorithm
- approximation ratio
- polynomial time approximation
- approximation methods
- minimum spanning tree
- approximation schemes
- computationally efficient
- approximation algorithms
- data clustering
- monte carlo
- ant colony optimization
- clustering method
- computational complexity
- decision trees
- neural network