Bruno Escoffier, Laurent Gourvès, Jérôme Monnot. Complexity and Approximation Results for the Connected Vertex Cover Problem. In Andreas Brandstädt, Dieter Kratsch, Haiko Müller, editors, Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers. Volume 4769 of Lecture Notes in Computer Science, pages 202-213, Springer, 2007. [doi]
Abstract is missing.