Abstract
This paper is concerned with the approximation complexity of the Connected Path Vertex Cover problem. The problem is a connected variant of the more basic problem of path vertex cover; in k-Path Vertex Cover it is required to compute a minimum vertex set \(C\subseteq V\) in a given undirected graph \(G=(V,E)\) such that no path on k vertices remains when all the vertices in C are removed from G. Connected k-Path Vertex Cover (k-CPVC) additionally requires C to induce a connected subgraph in G.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
