摘要

In this paper, we prove that there exists a combinatorial 3-approximation algorithm for the submodular vertex cover problem with submodular penalties introduced by Xu, Wang, Du, and Wu.

  • 出版日期2017-1-10