{"id":"https://openalex.org/W7162698260","doi":"https://doi.org/10.48550/arxiv.2605.27998","title":"Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs","display_name":"Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs","publication_year":2026,"publication_date":"2026-05-27","ids":{"openalex":"https://openalex.org/W7162698260","doi":"https://doi.org/10.48550/arxiv.2605.27998"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.27998","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.27998","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.27998","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137231043","display_name":"Ali Abbasi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Abbasi, Ali","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137283787","display_name":"Eli Friedman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Friedman, Eli","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081582862","display_name":"Leana Golubchik","orcid":"https://orcid.org/0000-0001-8353-5040"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Golubchik, Leana","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042716179","display_name":"Samir Khuller","orcid":"https://orcid.org/0000-0002-5408-8023"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Khuller, Samir","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5036380703","display_name":"Marco Paolieri","orcid":"https://orcid.org/0000-0001-5110-203X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Paolieri, Marco","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11807","display_name":"Infrastructure Resilience and Vulnerability Analysis","score":0.5160999894142151,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11807","display_name":"Infrastructure Resilience and Vulnerability Analysis","score":0.5160999894142151,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.22040000557899475,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.05849999934434891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5277000069618225},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5164999961853027},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.42590001225471497},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41929998993873596},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.41350001096725464},{"id":"https://openalex.org/keywords/interdiction","display_name":"Interdiction","score":0.40610000491142273},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.39070001244544983},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.3732999861240387},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.35190001130104065},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35019999742507935}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5277000069618225},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5164999961853027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48350000381469727},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.42590001225471497},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.421999990940094},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41929998993873596},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.41350001096725464},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4124000072479248},{"id":"https://openalex.org/C124119293","wikidata":"https://www.wikidata.org/wiki/Q6046081","display_name":"Interdiction","level":2,"score":0.40610000491142273},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.39070001244544983},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.3732999861240387},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35409998893737793},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.35190001130104065},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35019999742507935},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3499999940395355},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34279999136924744},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.33399999141693115},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.328000009059906},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3208000063896179},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3156000077724457},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.31349998712539673},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3125},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.29109999537467957},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.2904999852180481},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.2904999852180481},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.28439998626708984},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.28200000524520874},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.28029999136924744},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.26409998536109924},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.26260000467300415},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.2574999928474426},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.2526000142097473},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.27998","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.27998","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.27998","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.27998","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,71,100,151,162,176],"graph":[2],"$G$":[3,69],"of":[4,32,102,109,148,154,165,179],"$n$":[5],"nodes":[6],"partitioned":[7],"into":[8],"facilities":[9,193],"and":[10,56,112,115,132,138,160],"customers,":[11],"the":[12,29,41,60,110,116,170,185,196,213,224],"$r$-edge":[13],"interdiction":[14,172,182],"covering":[15,42,173,197],"problem":[16,61,174,183,219],"(REIC)":[17],"is":[18,39,47,70,91,128,187,207],"to":[19,22,27,49,135,146,188,191,194],"remove":[20,189],"up":[21,190],"$r$":[23,192],"edges":[24],"so":[25],"as":[26,223],"maximize":[28,195],"total":[30],"weight":[31],"customers":[33],"disconnected":[34,201],"from":[35],"all":[36],"facilities,":[37],"which":[38,237],"called":[40],"objective":[43,198],"function.":[44],"While":[45],"REIC":[46,87,145],"known":[48,222],"be":[50,63],"NP-complete":[51,208],"for":[52,86,144,233,243],"general":[53],"graphs,":[54],"Fr\u00f6hlich":[55,111],"Ruzika":[57,113],"show":[58,204],"that":[59,90,123,157,205],"can":[62],"solved":[64],"in":[65,94,124],"polynomial":[66],"time":[67],"when":[68],"tree,":[72],"providing":[73],"an":[74,80,230,240],"$O(n^7":[75],"r)$-time":[76],"algorithm.":[77],"We":[78,140,167,203,228],"give":[79,229],"efficient":[81],"$O(nr^2)$-time":[82,231],"dynamic":[83],"programming":[84],"algorithm":[85,114,127,143,232,242],"on":[88,99,235,245],"trees":[89],"fixed-parameter":[92],"linear":[93],"$n$.":[95],"Evaluating":[96],"our":[97,126,142],"solution":[98],"benchmark":[101],"randomly":[103],"generated":[104],"tree":[105],"networks":[106],"with":[107],"baselines":[108],"Gurobi":[117],"integer":[118],"program":[119],"solver,":[120],"we":[121],"demonstrate":[122],"practice,":[125],"both":[129],"significantly":[130],"faster":[131],"less":[133],"sensitive":[134],"network":[136,181],"topology":[137],"size.":[139],"extend":[141],"graphs":[147,156],"bounded":[149],"treewidth,":[150],"well-studied":[152],"family":[153],"sparse":[155],"generalizes":[158,212],"trees,":[159,236],"obtain":[161],"matching":[163],"runtime":[164],"$O(nr^2)$.":[166],"also":[168,221,238],"consider":[169],"$r$-facility":[171],"(RFIC),":[175],"novel":[177],"variant":[178],"this":[180],"where":[184],"goal":[186],"function":[199],"over":[200],"customers.":[202],"RFIC":[206,234],"by":[209],"observing":[210],"it":[211],"small":[214],"set":[215],"bipartite":[216],"vertex":[217],"expansion":[218],"(SSBVE),":[220],"minimum":[225],"$p$-union":[226],"problem.":[227],"gives":[239],"$O(n^3)$-time":[241],"SSBVE":[244],"trees.":[246]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-29T00:00:00"}