Author:
Cardinal Jean,Levy Eythan
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Garey, M.R., Johnson, D.S.: The rectilinear steiner tree problem is NP complete. SIAM Journal of Applied Mathematics 32, 826–834 (1977)
2. Savage, C.D.: Depth-first search and the vertex cover problem. Inf. Process. Lett. 14(5), 233–237 (1982)
3. Fernau, H., Manlove, D.: Vertex and edge covers with clustering properties: Complexity and algorithms. In: Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, Durham, UK, 18-20 September 2006, pp. 69–84 (2006)
4. Lecture Notes in Computer Science;B. Escoffier,2007
5. Fujito, T., Doi, T.: A 2-approximation NC algorithm for connected vertex cover and tree cover. Inf. Process. Lett. 90(2), 59–63 (2004)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献