The following publications are possibly variants of this publication:
- Approximation algorithms for minimum (weight) connected k-path vertex coverXiaosong Li, Zhao Zhang, Xiaohui Huang. DAM, 205:101-108, 2016. [doi]
- Approximation algorithm for minimum connected 3-path vertex coverPengcheng Liu, Zhao Zhang 0002, Xianyue Li, Weili Wu. DAM, 287:77-84, 2020. [doi]
- Approximation algorithm for the minimum weight connected k-subgraph cover problemYaping Zhang, Yishuo Shi, Zhao Zhang. TCS, 535:54-58, 2014. [doi]
- Approximation algorithms for minimum weight connected 3-path vertex coverYingli Ran, Zhao Zhang 0002, Xiaohui Huang, Xiaosong Li, Ding-Zhu Du. amc, 347:723-733, 2019. [doi]
- A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penaltiesXiaofei Liu, Weidong Li, Jinhua Yang. fcsc, 17(3):173404, 2023. [doi]