Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs

• 作者Bruno Escoffier; Laurent Gourvès; Jérôme Monnot
• 卷第8卷
• 期第1期
• 印刷ISSN1570-8667
• 文件大小346.19KB
• 发表时间2010
• DOI10.1016/j.jda.2009.01.005
• 页码36-49