Tree Deletion Set has a Polynomial Kernel (but no OPTO(1) approximation). Giannopoulou, A. C., Lokshtanov, D., Saurabh, S., & Suchý, O. CoRR, 2013.
Paper bibtex @article{ dblp2232022,
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 = {article},
type = {article},
year = {2013},
key = {dblp2232022},
id = {dblp2232022},
biburl = {http://www.dblp.org/rec/bibtex/journals/corr/GiannopoulouLSS13},
url = {http://arxiv.org/abs/1309.7891},
journal = {CoRR},
volume = {abs/1309.7891},
text = {CoRR abs/1309.7891 (2013)}
}
Downloads: 0
{"_id":"68TTPFnyMwFFM7Wwa","bibbaseid":"giannopoulou-lokshtanov-saurabh-such-treedeletionsethasapolynomialkernelbutnoopto1approximation-2013","downloads":0,"creationDate":"2016-02-19T11:50:52.714Z","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":2013,"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/corr/GiannopoulouLSS13","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":"article","type":"article","year":"2013","key":"dblp2232022","id":"dblp2232022","biburl":"http://www.dblp.org/rec/bibtex/journals/corr/GiannopoulouLSS13","url":"http://arxiv.org/abs/1309.7891","journal":"CoRR","volume":"abs/1309.7891","text":"CoRR abs/1309.7891 (2013)","bibtex":"@article{ dblp2232022,\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 = {article},\n type = {article},\n year = {2013},\n key = {dblp2232022},\n id = {dblp2232022},\n biburl = {http://www.dblp.org/rec/bibtex/journals/corr/GiannopoulouLSS13},\n url = {http://arxiv.org/abs/1309.7891},\n journal = {CoRR},\n volume = {abs/1309.7891},\n text = {CoRR abs/1309.7891 (2013)}\n}","bibbaseid":"giannopoulou-lokshtanov-saurabh-such-treedeletionsethasapolynomialkernelbutnoopto1approximation-2013","role":"author","urls":{"Paper":"http://arxiv.org/abs/1309.7891"},"downloads":0},"search_terms":["tree","deletion","set","polynomial","kernel","opto","approximation","giannopoulou","lokshtanov","saurabh","suchý"],"keywords":[],"authorIDs":[],"dataSources":["tGtn4Wky29cREh8ep"]}