Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties

Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties

“…We then give two primaldual approximation algorithms with η and 2η ratios for the SCSCLP and SCSCSP respectively. We point out that our work is closely related to three recent papers [6], [27] and [35]. We generalize the primal-dual method used in [6] and [27] for the facility location problem.…”

“…We generalize the primal-dual method used in [6] and [27] for the facility location problem. Furthermore, the problem studied by Xu et.al [35], in fact, can be seen as a special case of the problem we consider here.…”