Approximation algorithms for minimum weight connected 3-path vertex cover.
Yingli RanZhao ZhangXiaohui HuangXiaosong LiDing-Zhu DuPublished in: Appl. Math. Comput. (2019)
Keyphrases
- vertex cover
- minimum weight
- approximation algorithms
- minimum cost
- spanning tree
- planar graphs
- np hard
- greedy heuristic
- bipartite graph
- special case
- minimum spanning tree
- weighted graph
- worst case
- precedence constraints
- shortest path
- edge weights
- undirected graph
- connected components
- approximation ratio
- randomized algorithm
- tree patterns
- constant factor
- polynomial time approximation
- lower bound