Hans L. Bodlaender;Dimitrios M. Thilikos;Koichi Yamazaki
-;-;-
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science