Approximation algorithm for minimum connected 3-path vertex cover.
Pengcheng LiuZhao ZhangXianyue LiWeili WuPublished in: Discret. Appl. Math. (2020)
Keyphrases
- vertex cover
- approximation algorithms
- polynomial time approximation
- dynamic programming
- optimal solution
- computational complexity
- np hard
- worst case
- search space
- approximation ratio
- minimum cost
- objective function
- constant factor
- closed form
- learning algorithm
- error bounds
- knapsack problem
- energy function
- single machine scheduling problem
- theoretical analysis
- simulated annealing
- probabilistic model