Login / Signup
Two Heuristic Algorithms for the Minimum Weighted Connected Vertex Cover Problem Under Greedy Strategy.
Qipeng Xie
Yuchao Li
Sengui Hu
Yue Zhu
Hongqiang Wang
Published in:
IEEE Access (2022)
Keyphrases
</>
vertex cover
greedy strategy
greedy algorithm
approximation algorithms
planar graphs
partial order
minimum cost
precedence constraints
constant factor
image segmentation
worst case
polynomial time approximation
search space
dynamic programming
partially ordered