Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP

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]

@inproceedings{HemaspaandraRS02,
  title = {Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP},
  author = {Edith Hemaspaandra and Jörg Rothe and Holger Spakowski},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2573/25730258.htm},
  tags = {completeness},
  researchr = {https://researchr.org/publication/HemaspaandraRS02},
  cites = {0},
  citedby = {0},
  pages = {258-269},
  booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers},
  editor = {Ludek Kucera},
  volume = {2573},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-00331-2},
}