Tree Deletion Set Has a Polynomial Kernel (but no OPTO(1) Approximation). Giannopoulou, A. C., Lokshtanov, D., Saurabh, S., & Suchý, O. In *Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS)*, pages 85-96, 2014. Paper bibtex @inproceedings{ dblp2015752,
title = {Tree Deletion Set Has a Polynomial Kernel (but no OPTO(1) Approximation)},
author = {Archontia C. Giannopoulou and Daniel Lokshtanov and Saket Saurabh and Ondrej Suchý},
author_short = {Giannopoulou, A. C. and Lokshtanov, D. and Saurabh, S. and Suchý, O.},
bibtype = {inproceedings},
type = {inproceedings},
year = {2014},
key = {dblp2015752},
id = {dblp2015752},
biburl = {http://www.dblp.org/rec/bibtex/conf/fsttcs/GiannopoulouLSS14},
url = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.85},
conference = {FSTTCS},
pages = {85-96},
text = {FSTTCS 2014:85-96},
booktitle = {Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS)}
}

Downloads: 0

{"_id":"EzgTpsqEwp8oPoDK2","bibbaseid":"giannopoulou-lokshtanov-saurabh-such-treedeletionsethasapolynomialkernelbutnoopto1approximation-2014","downloads":0,"creationDate":"2016-02-19T11:50:52.667Z","title":"Tree Deletion Set Has a Polynomial Kernel (but no OPTO(1) Approximation)","author_short":["Giannopoulou, A. C.","Lokshtanov, D.","Saurabh, S.","Suchý, O."],"year":2014,"bibtype":"inproceedings","biburl":"http://www.dblp.org/rec/bibtex/conf/fsttcs/GiannopoulouLSS14","bibdata":{"title":"Tree Deletion Set Has a Polynomial Kernel (but no OPTO(1) Approximation)","author":["Archontia C. Giannopoulou","Daniel Lokshtanov","Saket Saurabh","Ondrej Suchý"],"author_short":["Giannopoulou, A. C.","Lokshtanov, D.","Saurabh, S.","Suchý, O."],"bibtype":"inproceedings","type":"inproceedings","year":"2014","key":"dblp2015752","id":"dblp2015752","biburl":"http://www.dblp.org/rec/bibtex/conf/fsttcs/GiannopoulouLSS14","url":"http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.85","conference":"FSTTCS","pages":"85-96","text":"FSTTCS 2014:85-96","booktitle":"Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS)","bibtex":"@inproceedings{ dblp2015752,\n title = {Tree Deletion Set Has a Polynomial Kernel (but no OPTO(1) Approximation)},\n author = {Archontia C. Giannopoulou and Daniel Lokshtanov and Saket Saurabh and Ondrej Suchý},\n author_short = {Giannopoulou, A. C. and Lokshtanov, D. and Saurabh, S. and Suchý, O.},\n bibtype = {inproceedings},\n type = {inproceedings},\n year = {2014},\n key = {dblp2015752},\n id = {dblp2015752},\n biburl = {http://www.dblp.org/rec/bibtex/conf/fsttcs/GiannopoulouLSS14},\n url = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.85},\n conference = {FSTTCS},\n pages = {85-96},\n text = {FSTTCS 2014:85-96},\n booktitle = {Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS)}\n}","bibbaseid":"giannopoulou-lokshtanov-saurabh-such-treedeletionsethasapolynomialkernelbutnoopto1approximation-2014","role":"author","urls":{"Paper":"http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.85"},"downloads":0},"search_terms":["tree","deletion","set","polynomial","kernel","opto","approximation","giannopoulou","lokshtanov","saurabh","suchý"],"keywords":[],"authorIDs":[],"dataSources":["Dcov88ESWs7NxHuh7"]}