![](/develop/static/imgs/pdf.png)
A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties
{{custom_author.name}}, {{article.zuoZheEn}}
A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties
[{{custom_ref.label}}] |
{{custom_citation.content}}
CrossRef
Pubmed
arXiv
Google scholar
|
/
〈 |
|
〉 |