An Approximation Algorithm for Covering Vertices by 4^+-Paths

Mingyang Gong, Zhi-Zhong Chen, Guohui Lin +1

This paper deals with the problem of finding a collection of vertex-disjoint paths in a given graph G=(V,E) such that each path has at least four vertices and the total number of v…