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

We introduce two set cover problems with submodular costs and linear/submodular penalties andoffer two approximation algorithms of ratios $\eta$ and $2\eta$ respectively via the primal-dualtechnique, where $\eta$ is the largest number of sets that each element belongs to.