1 results
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 40 / Issue 1 / January 2006
- Published online by Cambridge University Press:
- 15 October 2005, pp. 75-91
- Print publication:
- January 2006
-
- Article
- Export citation