Greedy approximations for minimum submodular cover with submodular cost

@article{Wan2010GreedyAF,
  title={Greedy approximations for minimum submodular cover with submodular cost},
  author={Peng-Jun Wan and Ding-Zhu Du and Panos M. Pardalos and Weili Wu},
  journal={Comp. Opt. and Appl.},
  year={2010},
  volume={45},
  pages={463-474}
}
It is well-known that a greedy approximation with an integer-valued polymatroid potential function f is H(γ )-approximation of the minimum submodular cover problem with linear cost where γ is the maximum value of f over all singletons and H(γ ) is the γ -th harmonic number. In this paper, we establish similar results for the minimum submodular cover problem with a submodular cost (possibly nonlinear) and/or fractional submodular potential function f . 
Highly Cited
This paper has 24 citations. REVIEW CITATIONS