Approximation algorithms for the maximum weight internal spanning tree problem.
Zhi-Zhong ChenGuohui LinLusheng WangYong ChenPublished in: CoRR (2016)
Keyphrases
- approximation algorithms
- maximum weight
- np hard
- spanning tree
- minimum weight
- minimum cost
- bipartite matching
- special case
- worst case
- independent set
- vertex cover
- bipartite graph
- weighted graph
- scheduling problem
- lower bound
- minimum spanning tree
- greedy heuristic
- undirected graph
- set cover
- optimal solution
- partial order
- randomized algorithms
- linear programming
- approximation ratio
- disjoint paths
- simulated annealing