Revisiting Garg's 2-Approximation Algorithm for the k-MST Problem in Graphs.
Emmett BreenRenee MirkaZichen WangDavid P. WilliamsonPublished in: CoRR (2023)
Keyphrases
- learning algorithm
- optimization algorithm
- detection algorithm
- cost function
- dynamic programming
- minimum spanning tree
- computational complexity
- theoretical analysis
- recognition algorithm
- k means
- computational cost
- high accuracy
- probabilistic model
- times faster
- graph structure
- experimental evaluation
- objective function
- worst case
- spanning tree
- significant improvement
- search space
- preprocessing
- error bounds
- similarity measure
- adjacency graph
- convergence rate
- matching algorithm
- ant colony optimization
- segmentation algorithm
- expectation maximization
- graphical models
- simulated annealing
- bayesian networks