Approximation algorithms for minimum weight partial connected set cover problem.
Dongyue LiangZhao ZhangXianliang LiuWei WangYaolin JiangPublished in: J. Comb. Optim. (2016)
Keyphrases
- set cover
- minimum weight
- approximation algorithms
- greedy heuristic
- np hard
- bipartite graph
- spanning tree
- minimum cost
- special case
- greedy algorithm
- worst case
- weighted graph
- knapsack problem
- connected components
- optimal solution
- primal dual
- network flow
- minimum spanning tree
- undirected graph
- tree patterns
- integer programming
- shortest path
- randomized algorithm
- lower bound