TY - JOUR
T1 - A note on the submodular vertex cover problem with submodular penalties
AU - Kamiyama, Naoyuki
N1 - Publisher Copyright:
© 2016 Elsevier B.V.
PY - 2017/1/10
Y1 - 2017/1/10
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85006825639&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85006825639&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2016.10.017
DO - 10.1016/j.tcs.2016.10.017
M3 - Article
AN - SCOPUS:85006825639
VL - 659
SP - 95
EP - 97
JO - Theoretical Computer Science
JF - Theoretical Computer Science
SN - 0304-3975
ER -