{"id":"https://openalex.org/W2489053438","doi":"https://doi.org/10.1137/15m1038876","title":"Tree Deletion Set Has a Polynomial Kernel but No $\\text{OPT}^\\mathcal{O}(1)$ Approximation)","display_name":"Tree Deletion Set Has a Polynomial Kernel but No $\\text{OPT}^\\mathcal{O}(1)$ Approximation)","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2489053438","doi":"https://doi.org/10.1137/15m1038876","mag":"2489053438"},"language":"en","primary_location":{"id":"doi:10.1137/15m1038876","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1038876","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021332621","display_name":"Archontia C. Giannopoulou","orcid":"https://orcid.org/0009-0001-4368-2852"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Archontia C. Giannopoulou","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015806060","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5062803495","display_name":"Ond\u0159ej Such\u00fd","orcid":"https://orcid.org/0000-0002-7236-8336"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ond\u0159ej Such\u00fd","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5021332621"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3939,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.83338466,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"30","issue":"3","first_page":"1371","last_page":"1384"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.9833554029464722},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8078346252441406},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7821980118751526},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5330072045326233},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5065904855728149},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.500786304473877},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.500584602355957},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.4791956841945648},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47630417346954346},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45176392793655396},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4429696798324585},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08485537767410278}],"concepts":[{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.9833554029464722},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8078346252441406},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7821980118751526},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5330072045326233},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5065904855728149},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.500786304473877},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.500584602355957},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.4791956841945648},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47630417346954346},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45176392793655396},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4429696798324585},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08485537767410278},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/15m1038876","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1038876","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3211800559","display_name":null,"funder_award_id":"306992","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G72107327","display_name":null,"funder_award_id":"267959","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G954457964","display_name":null,"funder_award_id":"14-13017P","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"}],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"},{"id":"https://openalex.org/F4320323898","display_name":"Bergens Forskningsstiftelse","ror":"https://ror.org/04efaep75"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1974810008","https://openalex.org/W1979312598","https://openalex.org/W1980809300","https://openalex.org/W2020545181","https://openalex.org/W2024517697","https://openalex.org/W2033040247","https://openalex.org/W2043644213","https://openalex.org/W2051937719","https://openalex.org/W2083748805","https://openalex.org/W2085819076","https://openalex.org/W2105325360","https://openalex.org/W2107285530","https://openalex.org/W2137118456","https://openalex.org/W2568031003","https://openalex.org/W3101258912"],"related_works":["https://openalex.org/W1963195391","https://openalex.org/W4318567365","https://openalex.org/W135432853","https://openalex.org/W4301033083","https://openalex.org/W2951585934","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415"],"abstract_inverted_index":{"In":[0,60],"the":[1,6,70,98],"Tree":[2,71,102],"Deletion":[3,72,103],"Set":[4,73,104],"problem":[5,41],"input":[7],"is":[8,19,37,42,82,105],"a":[9,25,38,83],"graph":[10],"$G$":[11],"together":[12],"with":[13],"an":[14,65],"integer":[15],"$k$.":[16],"The":[17,40],"objective":[18],"to":[20,49,96,107],"determine":[21],"whether":[22],"there":[23],"exists":[24],"set":[26],"$S$":[27],"of":[28,54,78,90],"at":[29],"most":[30],"$k$":[31],"vertices":[32],"such":[33],"that":[34,93],"$G\\setminus":[35],"S$":[36],"tree.":[39],"\\tt":[43,47],"NP-complete":[44],"and":[45],"even":[46],"NP-hard":[48],"approximate":[50],"within":[51],"any":[52,57],"factor":[53],"$\\text{OPT}^c$":[55],"for":[56,69],"constant":[58],"$c$.":[59],"this":[61],"paper":[62],"we":[63,94],"give":[64],"$\\mathcal{O}(k^5)$":[66],"size":[67],"kernel":[68],"problem.":[74],"An":[75],"appealing":[76],"feature":[77],"our":[79],"kernelization":[80],"algorithm":[81],"new":[84],"reduction":[85],"rule,":[86],"based":[87],"on":[88,100],"systems":[89],"linear":[91],"equations,":[92],"use":[95],"handle":[97],"instances":[99],"which":[101],"hard":[106],"approximate.":[108]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}