Approximation of Natural W[P]-Complete Minimisation Problems Is Hard. Eickmeyer, K., Grohe, M., & Grüber, M. In Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pages 8–18, 2008.
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/coco/EickmeyerGG08,
  author    = {Kord Eickmeyer and
               Martin Grohe and
               Magdalena Gr{\"{u}}ber},
  title     = {Approximation of Natural W[P]-Complete Minimisation Problems Is Hard},
  booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
               Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
  pages     = {8--18},
  year      = {2008},
  crossref  = {DBLP:conf/coco/2008},
  url       = {https://doi.org/10.1109/CCC.2008.24},
  doi       = {10.1109/CCC.2008.24},
  timestamp = {Thu, 02 Feb 2023 13:27:09 +0100},
  biburl    = {https://dblp.org/rec/conf/coco/EickmeyerGG08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0