Complexity and approximation results for the connected...

Journal of Discrete Algorithms 2010 Vol. 8; Iss. 1

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

Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
8
Year:
2010
Language:
english
Pages:
14
DOI:
10.1016/j.jda.2009.01.005
File:
PDF, 346 KB
english, 2010
Conversion to is in progress
Conversion to is failed