RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)

Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP

Edith Hemaspaandra, Jörg Rothe and Holger Spakowski

RAIRO-Theor. Inf. Appl., 40 1 (2006) 75-91

Published online: 15 October 2005

DOI: 10.1051/ita:2005041

Edith Hemaspaandra

Jörg Rothe

Holger Spakowski

Articles written by ALL the selected authors (AND)

Articles written by ANY OF the selected authors (OR)