BibTeX record conf/wg/HemaspaandraRS02

• > Home > conf/wg/HemaspaandraRS02

@inproceedings{DBLP:conf/wg/HemaspaandraRS02,
  author       = {Edith Hemaspaandra and
                  J{\"{o}}rg Rothe and
                  Holger Spakowski},
  editor       = {Ludek Kucera},
  title        = {Recognizing When Heuristics Can Approximate Minimum Vertex Covers
                  Is Complete for Parallel Access to {NP}},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop,
                  {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {2573},
  pages        = {258--269},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-36379-3\_23},
  doi          = {10.1007/3-540-36379-3\_23},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/HemaspaandraRS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}