A 4/3-approximation algorithm for finding a spanning tree to maximize its internal vertices.
Xingfu LiDaming ZhuPublished in: CoRR (2014)
Keyphrases
- spanning tree
- minimum weight
- minimum spanning tree
- np hard
- computational complexity
- k means
- objective function
- optimal solution
- detection algorithm
- undirected graph
- dynamic programming
- expectation maximization
- edge disjoint
- learning algorithm
- minimum length
- approximation ratio
- weighted graph
- probabilistic model
- minimum cost
- graph structure
- approximation algorithms
- error bounds
- greedy heuristic
- convex hull
- tree structure
- social network analysis
- hamiltonian cycle