Liu, Xianliang; Lu, Hongliang; Wang, Wei; Wu, Weili - In: Journal of Global Optimization 56 (2013) 2, pp. 449-458
In the Minimum k-Path Connected Vertex Cover Problem (MkPCVCP), we are given a connected graph G and an integer k ≥ 2, and are required to find a subset C of vertices with minimum cardinality such that each path with length k − 1 has a vertex in C, and moreover, the induced subgraph G[C]...
