Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem.
Zhi-Zhong ChenGuohui LinLusheng WangYong ChenDan WangPublished in: Algorithmica (2019)
Keyphrases
- approximation algorithms
- maximum weight
- np hard
- spanning tree
- minimum weight
- minimum cost
- bipartite matching
- special case
- vertex cover
- independent set
- bipartite graph
- worst case
- minimum spanning tree
- weighted graph
- approximation ratio
- set cover
- randomized algorithms
- undirected graph
- scheduling problem
- edge weights
- partial order
- branch and bound algorithm
- linear programming
- lower bound
- optimal solution
- constant factor approximation
- polynomial time approximation
- genetic algorithm
- planar graphs
- precedence constraints
- random walk
- markov chain
- upper bound
- search space
- computational complexity
- objective function