Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem.
Zhi-Zhong ChenGuohui LinLusheng WangYong ChenDan WangPublished in: COCOON (2017)
Keyphrases
- approximation algorithms
- maximum weight
- np hard
- spanning tree
- minimum weight
- minimum cost
- bipartite matching
- independent set
- worst case
- special case
- minimum spanning tree
- partial order
- bipartite graph
- approximation ratio
- vertex cover
- weighted graph
- set cover
- lower bound
- optimal solution
- linear programming
- scheduling problem
- randomized algorithms
- branch and bound algorithm
- constant factor approximation
- constant factor
- combinatorial optimization
- greedy heuristic
- edge weights
- random walk
- computational complexity