A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties
The k-prize-collecting minimum vertex cover problem with submodular penalties (k-PCVCS) is a generalization of the minimum vertex cover problem, which ...