Front. Comput. Sci. ›› DOI: 10.3868/fcs-video-024

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}}

Keywords

Cite this video

EndNote

Ris (Procite)

Bibtex

Download citation ▾
{{article.zuoZheEn_L}}. {{article.titleEn}}. Front. Comput. Sci., https://doi.org/10.3868/fcs-video-024
Related videos

References

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

References

{{article.reference}}

RIGHTS & PERMISSIONS

{{article.copyright.year}} {{article.copyright.holder}}

Linked article:

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

Xiaofei LIU, Weidong LI, Jinhua YANG

Front. Comput. Sci.. 2023, Vol.17(3): 173404

Accesses

Citations

Recommended

/

〈 〉