{"id":"https://openalex.org/W2905516683","doi":"https://doi.org/10.1145/3173046","title":"Firefighting on Trees Beyond Integrality Gaps","display_name":"Firefighting on Trees Beyond Integrality Gaps","publication_year":2018,"publication_date":"2018-12-07","ids":{"openalex":"https://openalex.org/W2905516683","doi":"https://doi.org/10.1145/3173046","mag":"2905516683"},"language":"en","primary_location":{"id":"doi:10.1145/3173046","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3173046","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5015422703","display_name":"David Adjiashvili","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"David Adjiashvili","raw_affiliation_strings":["ETH Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089242180","display_name":"Andrea Baggio","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Andrea Baggio","raw_affiliation_strings":["ETH Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033406324","display_name":"Rico Zenklusen","orcid":"https://orcid.org/0000-0002-7148-9304"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Rico Zenklusen","raw_affiliation_strings":["ETH Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-7148-9304","affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5015422703"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":0.4299,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.67879129,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"15","issue":"2","first_page":"1","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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.9884999990463257,"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/vertex","display_name":"Vertex (graph theory)","score":0.6614826917648315},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.624677300453186},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6049517393112183},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5771623253822327},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5165859460830688},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5114792585372925},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4757894277572632},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4622921645641327},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4188210964202881},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.41159582138061523},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40566739439964294},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3525652289390564},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34161725640296936},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0898134708404541}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6614826917648315},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.624677300453186},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6049517393112183},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5771623253822327},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5165859460830688},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5114792585372925},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4757894277572632},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4622921645641327},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4188210964202881},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.41159582138061523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40566739439964294},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3525652289390564},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34161725640296936},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0898134708404541},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3173046","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3173046","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5926618553","display_name":null,"funder_award_id":"200021_165866","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W314667627","https://openalex.org/W1505332898","https://openalex.org/W1530136340","https://openalex.org/W1609723440","https://openalex.org/W1966395945","https://openalex.org/W1976619117","https://openalex.org/W1979983781","https://openalex.org/W1989453388","https://openalex.org/W1994912113","https://openalex.org/W2015784652","https://openalex.org/W2023624817","https://openalex.org/W2049349022","https://openalex.org/W2053514817","https://openalex.org/W2061068662","https://openalex.org/W2064408514","https://openalex.org/W2093573708","https://openalex.org/W2095274987","https://openalex.org/W2132651631","https://openalex.org/W2134746936","https://openalex.org/W2143996311","https://openalex.org/W2202118583","https://openalex.org/W2576405252","https://openalex.org/W2593918671","https://openalex.org/W2741095019","https://openalex.org/W2988480584","https://openalex.org/W3123402719","https://openalex.org/W4389615664"],"related_works":["https://openalex.org/W3151522584","https://openalex.org/W1497123311","https://openalex.org/W2090386787","https://openalex.org/W3123242903","https://openalex.org/W2110536527","https://openalex.org/W2222736632","https://openalex.org/W2155226164","https://openalex.org/W2364531301","https://openalex.org/W2070751425","https://openalex.org/W2963158951"],"abstract_inverted_index":{"The":[0,105],"Firefighter":[1,106,160,196],"problem":[2,107,161,197],"and":[3,64,90,162,174,198],"a":[4,51,74,110,128,192,216],"variant":[5],"of":[6,22,34,56,67,118,142,180,218,235],"it,":[7],"known":[8,151,208,220],"as":[9],"Resource":[10],"Minimization":[11],"for":[12,19,109,138,158,169,194,202,228],"Fire":[13],"Containment":[14],"(RMFC),":[15],"are":[16,213],"natural":[17,182,240],"models":[18],"optimal":[20],"inhibition":[21],"harmful":[23],"spreading":[24],"processes.":[25],"Despite":[26],"considerable":[27],"progress":[28],"on":[29,187],"several":[30,223],"fronts,":[31],"the":[32,43,47,57,65,116,133,143,149,159,177,195,207,219,239],"approximability":[33],"these":[35],"problems":[36],"is":[37,42,50,54],"still":[38],"badly":[39],"understood.":[40],"This":[41],"case":[44],"even":[45],"when":[46],"underlying":[48],"graph":[49,59],"tree,":[52],"which":[53,226],"one":[55,78],"most-studied":[58],"structures":[60],"in":[61],"this":[62,68,147],"context":[63],"focus":[66],"article.":[69],"In":[70],"their":[71],"simplest":[72],"version,":[73],"fire":[75],"spreads":[76],"from":[77,84,102],"fixed":[79],"vertex":[80],"step":[81,83,94],"by":[82,190],"burning":[85],"to":[86,114,131,146,237],"adjacent":[87],"non-burning":[88,97],"vertices,":[89],"at":[91],"each":[92],"time":[93],"B":[95,112,135],"many":[96],"vertices":[98,119],"can":[99],"be":[100],"protected":[101],"catching":[103],"fire.":[104],"asks,":[108],"given":[111],",":[113],"maximize":[115],"number":[117],"that":[120,136],"will":[121],"not":[122],"catch":[123],"fire,":[124],"whereas":[125],"RMFC":[126],"(on":[127],"tree)":[129],"asks":[130],"find":[132],"smallest":[134],"allows":[137],"saving":[139],"all":[140],"leaves":[141],"tree.":[144],"Prior":[145],"work,":[148],"best":[150],"approximation":[152],"ratios":[153],"were":[154],"an":[155,163,199],"O":[156,164,200],"(1)-approximation":[157,201],"(log":[165],"*":[166],"n":[167],")-approximation":[168],"RMFC,":[170,203],"both":[171,188,204],"being":[172],"LP-based":[173],"essentially":[175],"matching":[176,206],"integrality":[178],"gaps":[179],"two":[181],"LP":[183],"relaxations.":[184],"We":[185],"improve":[186],"approximations":[189],"presenting":[191],"PTAS":[193],"qualitatively":[205],"hardness":[209],"results.":[210],"Our":[211],"results":[212],"obtained":[214],"through":[215],"combination":[217],"LPs":[221],"with":[222],"new":[224],"techniques,":[225],"allow":[227],"efficiently":[229],"enumerating":[230],"over":[231],"super-constant":[232],"size":[233],"sets":[234],"constraints":[236],"strengthen":[238],"LPs.":[241]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}