1. The rectilinear Steiner tree problem is NP complete;Garey;SIAM J. Appl. Math.,1977
2. Depth-first search and the vertex cover problem;Savage;Inform. Process. Lett.,1982
3. H. Fernau, D. Manlove, Vertex and edge covers with clustering properties: complexity and algorithms, in: Algorithms and Complexity in Durham 2006 — Proceedings of the Second ACiD Workshop, 18–20 September 2006, Durham, UK, 2006, pp. 69–84.
4. Complexity and approximation results for the connected vertex cover problem;Escoffier,2007
5. A 2-approximation NC algorithm for connected vertex cover and tree cover;Fujito;Inform. Process. Lett.,2004