Edith Hemaspaandra, Jörg Rothe, Holger Spakowski. Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. In Ludek Kucera, editor, Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers. Volume 2573 of Lecture Notes in Computer Science, pages 258-269, Springer, 2002. [doi]
Abstract is missing.