Approximation algorithm for minimum connected 3-path vertex cover

DOI10.1016/j.dam.2020.08.008zbMath1448.05164MaRDI QIDQ2004079

Weili Wu, Zhao Zhang, Xianyue Li, Pengcheng Liu

Publication date: 14 October 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.08.008

zbMATH Keywords

approximation algorithm; connected \(k\)-path vertex cover

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms

05C40: Connectivity