Approximation algorithm for submodular maximization under submodular cover

Naoto Ohsaka, Tatsuya Matsuoka

Abstract: We study a new optimization problem called <em>submodular maximization under submodular cover</em> (SMSC), which requires to find a fixed-size set such that one monotone submodular function $f$ is ...