TY  - JOUR
AU  - Hemaspaandra, Edith
AU  - Rothe, Jörg
AU  - Spakowski, Holger
TI  - Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2006
SP  - 75
EP  - 91
VL  - 40
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/articles/10.1051/ita:2005041/
DO  - 10.1051/ita:2005041
LA  - en
ID  - ITA_2006__40_1_75_0
ER  -