A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties

{{article.zuoZheEn}}

PDF(2172 KB)
PDF(2172 KB)
Front. Comput. Sci. ›› 2023, Vol. 17 ›› Issue (3) : 173404. DOI: 10.1007/s11704-022-1665-9
RESEARCH ARTICLE

A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties

  • {{article.zuoZheEn}}
Author information +
History +

Highlights

{{article.highlightEn}}

Abstract

{{article.abstractEn}}

Author summary

{{article.authorSummayEn}}

Graphical abstract

Keywords

Cite this article

EndNote

Ris (Procite)

Bibtex

Download citation ▾
{{article.zuoZheEn_L}}. {{article.titleEn}}. Front. Comput. Sci., 2023, 17(3): 173404 https://doi.org/10.1007/s11704-022-1665-9

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

{{article.reference}}

RIGHTS & PERMISSIONS

{{article.copyright.year}} {{article.copyright.holder}}
PDF(2172 KB)

Accesses

Citations

Detail
Sections
Recommended

/

〈 〉