{"id":"https://openalex.org/W3042150117","doi":"https://doi.org/10.1145/3389338","title":"Polylogarithmic Approximation Algorithms for Weighted-\u2131-deletion Problems","display_name":"Polylogarithmic Approximation Algorithms for Weighted-\u2131-deletion Problems","publication_year":2020,"publication_date":"2020-07-07","ids":{"openalex":"https://openalex.org/W3042150117","doi":"https://doi.org/10.1145/3389338","mag":"3042150117"},"language":"en","primary_location":{"id":"doi:10.1145/3389338","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3389338","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/A5029431771","display_name":"Akanksha Agrawal","orcid":"https://orcid.org/0000-0002-0656-7572"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Akanksha Agrawal","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beersheba, Israel"],"raw_orcid":"https://orcid.org/0000-0002-0656-7572","affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beersheba, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["University of California Santa Barbara, California, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California Santa Barbara, California, United States","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045302816","display_name":"Pranabendu Misra","orcid":"https://orcid.org/0000-0002-7086-5590"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Pranabendu Misra","raw_affiliation_strings":["Max Planck Institute for Informatics, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015806060","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]},{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN","NO"],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":["University of Bergen, Norway and The Institute of Mathematical Sciences, Tharamani, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bergen, Norway and The Institute of Mathematical Sciences, Tharamani, Chennai, India","institution_ids":["https://openalex.org/I4432739","https://openalex.org/I59611059"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082025487","display_name":"Meirav Zehavi","orcid":"https://orcid.org/0000-0002-3636-5322"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Meirav Zehavi","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beersheba, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beersheba, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":5,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9048,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.8018547,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"16","issue":"4","first_page":"1","last_page":"38"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9973000288009644,"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.9973000288009644,"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.996999979019165,"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/T12149","display_name":"Nanocluster Synthesis and Applications","score":0.9842000007629395,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7870818376541138},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7360379695892334},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6432371735572815},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5635020732879639},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5232676267623901},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.46707916259765625},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4632723331451416},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4329510033130646},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.4231390953063965},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4135925769805908},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39836645126342773},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37335067987442017}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7870818376541138},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7360379695892334},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6432371735572815},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5635020732879639},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5232676267623901},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.46707916259765625},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4632723331451416},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4329510033130646},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4231390953063965},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4135925769805908},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39836645126342773},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37335067987442017}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3389338","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3389338","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/G2810398634","display_name":null,"funder_award_id":"1176/18","funder_id":"https://openalex.org/F4320320950","funder_display_name":"United States-Israel Binational Science Foundation"},{"id":"https://openalex.org/G5730270640","display_name":null,"funder_award_id":"2018302","funder_id":"https://openalex.org/F4320320950","funder_display_name":"United States-Israel Binational Science Foundation"},{"id":"https://openalex.org/G5732392639","display_name":"Parameterized Approximation","funder_award_id":"306992","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"},{"id":"https://openalex.org/G6375291333","display_name":null,"funder_award_id":"819416 and 715744","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"}],"funders":[{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"},{"id":"https://openalex.org/F4320338352","display_name":"FP7 Ideas: European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W1563577400","https://openalex.org/W1591716186","https://openalex.org/W1787689584","https://openalex.org/W1889872997","https://openalex.org/W1936855748","https://openalex.org/W1968402726","https://openalex.org/W1981356557","https://openalex.org/W1983860528","https://openalex.org/W1993328543","https://openalex.org/W1994706865","https://openalex.org/W1996472240","https://openalex.org/W2004181701","https://openalex.org/W2005079828","https://openalex.org/W2013568176","https://openalex.org/W2024517697","https://openalex.org/W2026646714","https://openalex.org/W2033040247","https://openalex.org/W2043791970","https://openalex.org/W2044343300","https://openalex.org/W2051937719","https://openalex.org/W2053991811","https://openalex.org/W2057826895","https://openalex.org/W2063951771","https://openalex.org/W2064600658","https://openalex.org/W2067016370","https://openalex.org/W2075339720","https://openalex.org/W2076164610","https://openalex.org/W2081880478","https://openalex.org/W2089417393","https://openalex.org/W2120358419","https://openalex.org/W2143474538","https://openalex.org/W2150148016","https://openalex.org/W2161719898","https://openalex.org/W2170114629","https://openalex.org/W2171507355","https://openalex.org/W2296118781","https://openalex.org/W2504287189","https://openalex.org/W2540298124","https://openalex.org/W2570928946","https://openalex.org/W2795868260","https://openalex.org/W2891457632","https://openalex.org/W2900382700","https://openalex.org/W2949245734","https://openalex.org/W2963554461","https://openalex.org/W3022173737","https://openalex.org/W4213174622","https://openalex.org/W4214929771","https://openalex.org/W4247051268"],"related_works":["https://openalex.org/W2279830512","https://openalex.org/W3046990805","https://openalex.org/W3097369619","https://openalex.org/W4287691960","https://openalex.org/W2963181990","https://openalex.org/W2007715402","https://openalex.org/W2913663107","https://openalex.org/W2960354271","https://openalex.org/W2899261484","https://openalex.org/W2004524662"],"abstract_inverted_index":{"For":[0],"a":[1,27,38,58,98,104,166,169,193,210,264],"family":[2,116,251],"of":[3,76,101,117,252],"graphs":[4,102,118,131],"\u2131,":[5],"the":[6,73,83,91,114,148,200,217,245,250,256],"W":[7,149,236,286],"eighted":[8,150,237,287],"\u2131":[9],"V":[10,32,44,240,292],"ertex":[11,241,293],"D":[12,158,242,288,294],"eletion":[13,159,243,295],"problem,":[14],"is":[15,147],"defined":[16],"as":[17,134,317],"follows:":[18],"given":[19],"an":[20,228,278],"n":[21,65,87,181,186,231,281,310],"-vertex":[22],"undirected":[23],"graph":[24,122],"G":[25,34,46,50,109,125,143],"and":[26,107,168,183],"weight":[28,40],"function":[29],"w":[30],":":[31],"(":[33,45,110,126,144],")\u0890":[35],"\u211d,":[36],"find":[37],"minimum":[39],"subset":[41],"S":[42,52],"\u2286":[43],")":[47,112,128,146,182],"such":[48,69,119],"that":[49,120,299],"-":[51],"belongs":[53],"to":[54,61,141,190,249,258,306],"\u2131.":[55],"We":[56,81,164,226,276,297],"devise":[57],"recursive":[59,301],"scheme":[60,302],"obtain":[62,82,263,307],"O(log":[63,85,179,184,229,279,308],"O(1)":[64,86,309],")-approximation":[66,88,311],"algorithms":[67,89,172,312],"for":[68,90,173,199,216,235,269,285,313],"problems,":[70],"building":[71],"upon":[72],"classical":[74],"technique":[75],"finding":[77],"balanced":[78],"separators":[79],".":[80,296],"first":[84],"following":[92],"problems.":[93],"\u2022":[94,225,275],"Let":[95],"F":[96,111,127,133,145,153,161,175],"be":[97,113,304],"finite":[99],"set":[100],"containing":[103],"planar":[105],"graph,":[106],"\u2131=":[108,142],"maximal":[115],"every":[121],"H":[123,290],"\u2208":[124],"excludes":[129],"all":[130],"in":[132],"minors.":[135],"The":[136],"vertex":[137,246],"deletion":[138,247],"problem":[139,248],"corresponding":[140],"P":[151],"lanar":[152],"-M":[154],"inor":[155],"-F":[156],"ree":[157],"(WP":[160],"-MFD)":[162],"problem.":[163],"give":[165,227,277],"randomized":[167,194],"deterministic":[170,211],"approximation":[171,197,214,233,267,283],"WP":[174],"-MFD":[176],"with":[177],"ratios":[178],"1.5":[180],"2":[185,230],"),":[187],"respectively.":[188],"Prior":[189],"our":[191,208,300],"work,":[192,209],"constant":[195,212,265],"factor":[196,213,266],"algorithm":[198,215,234,268,284],"unweighted":[201,218],"version":[202,219],"was":[203,220],"known":[204],"[FOCS":[205],"2012].":[206],"After":[207],"also":[221,262],"obtained":[222],"[SODA":[223],"2019].":[224],")-factor":[232,282],"C":[238],"hordal":[239],",":[244],"chordal":[253,273],"graphs.":[254,274],"On":[255],"way":[257],"this":[259],"algorithm,":[260],"we":[261],"M":[270],"ulticut":[271],"on":[272],"3":[280],"istance":[289],"ereditary":[291],"believe":[298],"can":[303],"applied":[305],"many":[314],"other":[315],"problems":[316],"well.":[318]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}