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.
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
{"_id":"4S6EhfEL58neiMNBz","bibbaseid":"eickmeyer-grohe-grber-approximationofnaturalwpcompleteminimisationproblemsishard-2008","authorIDs":["oWamqdovFccHcFdCZ"],"author_short":["Eickmeyer, K.","Grohe, M.","Grüber, M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Kord"],"propositions":[],"lastnames":["Eickmeyer"],"suffixes":[]},{"firstnames":["Martin"],"propositions":[],"lastnames":["Grohe"],"suffixes":[]},{"firstnames":["Magdalena"],"propositions":[],"lastnames":["Grüber"],"suffixes":[]}],"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","bibtex":"@inproceedings{DBLP:conf/coco/EickmeyerGG08,\n author = {Kord Eickmeyer and\n Martin Grohe and\n Magdalena Gr{\\\"{u}}ber},\n title = {Approximation of Natural W[P]-Complete Minimisation Problems Is Hard},\n booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational\n Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},\n pages = {8--18},\n year = {2008},\n crossref = {DBLP:conf/coco/2008},\n url = {https://doi.org/10.1109/CCC.2008.24},\n doi = {10.1109/CCC.2008.24},\n timestamp = {Thu, 02 Feb 2023 13:27:09 +0100},\n biburl = {https://dblp.org/rec/conf/coco/EickmeyerGG08.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Eickmeyer, K.","Grohe, M.","Grüber, M."],"key":"DBLP:conf/coco/EickmeyerGG08","id":"DBLP:conf/coco/EickmeyerGG08","bibbaseid":"eickmeyer-grohe-grber-approximationofnaturalwpcompleteminimisationproblemsishard-2008","role":"author","urls":{"Paper":"https://doi.org/10.1109/CCC.2008.24"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://dblp.org/pers/tb2/g/Grohe:Martin","creationDate":"2021-01-02T18:30:33.516Z","downloads":0,"keywords":[],"search_terms":["approximation","natural","complete","minimisation","problems","hard","eickmeyer","grohe","grüber"],"title":"Approximation of Natural W[P]-Complete Minimisation Problems Is Hard","year":2008,"dataSources":["jS7oF7ycnJjCpQRs7"]}