{"id":"https://openalex.org/W2890355536","doi":"https://doi.org/10.1145/3239560","title":"Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs","display_name":"Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs","publication_year":2018,"publication_date":"2018-09-17","ids":{"openalex":"https://openalex.org/W2890355536","doi":"https://doi.org/10.1145/3239560","mag":"2890355536"},"language":"en","primary_location":{"id":"doi:10.1145/3239560","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3239560","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/A5059330513","display_name":"Marcin Pilipczuk","orcid":"https://orcid.org/0000-0001-5680-7397"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Marcin Pilipczuk","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000479623","display_name":"Micha\u0142 Pilipczuk","orcid":"https://orcid.org/0000-0001-7891-1988"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Micha\u0142 Pilipczuk","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025494465","display_name":"Piotr Sankowski","orcid":"https://orcid.org/0000-0002-0907-3754"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Piotr Sankowski","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041371022","display_name":"Erik Jan van Leeuwen","orcid":"https://orcid.org/0000-0001-5240-7257"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Erik Jan Van Leeuwen","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5059330513"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":null,"apc_paid":null,"fwci":1.9233,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.87887408,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"14","issue":"4","first_page":"1","last_page":"73"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9988999962806702,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.863203763961792},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7971748113632202},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7744381427764893},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7099985480308533},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6274948120117188},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5701513886451721},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5145158767700195},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5017917156219482},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47924354672431946},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4634966552257538},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38430699706077576},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.28759410977363586},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08251887559890747}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.863203763961792},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7971748113632202},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7744381427764893},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7099985480308533},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6274948120117188},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5701513886451721},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5145158767700195},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5017917156219482},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47924354672431946},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4634966552257538},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38430699706077576},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.28759410977363586},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08251887559890747},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3239560","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3239560","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"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/376744","is_oa":false,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/376744","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Algorithms, 14(4). Association for Computing Machinery (ACM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1077156815","display_name":null,"funder_award_id":"2011-2014","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G1533455792","display_name":null,"funder_award_id":"677651","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G2761285720","display_name":null,"funder_award_id":"FP/2007-2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G3501181538","display_name":null,"funder_award_id":"259515 and 267959","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"},{"id":"https://openalex.org/G3981126665","display_name":null,"funder_award_id":"Seventh Framework Programme","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G4956428346","display_name":null,"funder_award_id":"Horizon 2020 research and innovatio","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5244030528","display_name":null,"funder_award_id":"714704","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5593277320","display_name":null,"funder_award_id":"2007-2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5803244198","display_name":null,"funder_award_id":"2007-2013","funder_id":"https://openalex.org/F4320321042","funder_display_name":"Fundacja na rzecz Nauki Polskiej"},{"id":"https://openalex.org/G6492145964","display_name":"RIGOROUS THEORY OF PREPROCESSING","funder_award_id":"267959","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G7373564934","display_name":null,"funder_award_id":"714704 and 677651","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G7980471698","display_name":"Practical Approximation Algorithms","funder_award_id":"259515","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8051717526","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8318064016","display_name":null,"funder_award_id":"Horizon","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321042","display_name":"Fundacja na rzecz Nauki Polskiej","ror":"https://ror.org/048zd9m77"},{"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":81,"referenced_works":["https://openalex.org/W95416648","https://openalex.org/W100926944","https://openalex.org/W171155747","https://openalex.org/W1408746698","https://openalex.org/W1517036688","https://openalex.org/W1523762238","https://openalex.org/W1540680813","https://openalex.org/W1544829330","https://openalex.org/W1546924356","https://openalex.org/W1552413686","https://openalex.org/W1567597677","https://openalex.org/W1580945513","https://openalex.org/W1593947471","https://openalex.org/W1607394607","https://openalex.org/W1966397930","https://openalex.org/W1976463682","https://openalex.org/W1976584101","https://openalex.org/W1976957234","https://openalex.org/W1986916307","https://openalex.org/W1991055327","https://openalex.org/W1992869351","https://openalex.org/W1995725694","https://openalex.org/W1996575062","https://openalex.org/W1997906261","https://openalex.org/W1998964055","https://openalex.org/W2000311286","https://openalex.org/W2002041206","https://openalex.org/W2009695707","https://openalex.org/W2011823863","https://openalex.org/W2015321560","https://openalex.org/W2015963099","https://openalex.org/W2020112047","https://openalex.org/W2028558845","https://openalex.org/W2031229603","https://openalex.org/W2039305125","https://openalex.org/W2040112642","https://openalex.org/W2045749371","https://openalex.org/W2051540665","https://openalex.org/W2052712469","https://openalex.org/W2065166038","https://openalex.org/W2067081844","https://openalex.org/W2070664846","https://openalex.org/W2078443814","https://openalex.org/W2081421381","https://openalex.org/W2085348754","https://openalex.org/W2086937160","https://openalex.org/W2092029376","https://openalex.org/W2103099082","https://openalex.org/W2107284348","https://openalex.org/W2114288716","https://openalex.org/W2115049345","https://openalex.org/W2119741712","https://openalex.org/W2121641644","https://openalex.org/W2127485201","https://openalex.org/W2150855695","https://openalex.org/W2152986618","https://openalex.org/W2154257711","https://openalex.org/W2156760067","https://openalex.org/W2158584754","https://openalex.org/W2167236203","https://openalex.org/W2255673366","https://openalex.org/W2277438216","https://openalex.org/W2289086174","https://openalex.org/W2404960361","https://openalex.org/W2506385334","https://openalex.org/W2563156040","https://openalex.org/W2570206580","https://openalex.org/W2587218781","https://openalex.org/W2593640369","https://openalex.org/W2733367155","https://openalex.org/W2762935521","https://openalex.org/W2798588639","https://openalex.org/W2894976529","https://openalex.org/W2913688336","https://openalex.org/W2963253390","https://openalex.org/W2997658321","https://openalex.org/W3108106901","https://openalex.org/W3121437753","https://openalex.org/W3121576764","https://openalex.org/W4245082111","https://openalex.org/W6712591001"],"related_works":["https://openalex.org/W2035613592","https://openalex.org/W2075531723","https://openalex.org/W2945561475","https://openalex.org/W4285659194","https://openalex.org/W4389814085","https://openalex.org/W3048010228","https://openalex.org/W3031065515","https://openalex.org/W4301463689","https://openalex.org/W2605313623","https://openalex.org/W2952055179"],"abstract_inverted_index":{"We":[0,91],"propose":[1],"polynomial-time":[2,24,308],"algorithms":[3],"that":[4,70,81,136,146,206,219,232,371],"sparsify":[5],"planar":[6,179,264,288],"and":[7,40,68,112,145,152,182,231,258,265,275,278,336],"bounded-genus":[8,266],"graphs":[9,267,289],"while":[10],"preserving":[11],"optimal":[12,73,139,165,209,390],"or":[13],"near-optimal":[14],"solutions":[15],"to":[16,96],"Steiner":[17,74,140,166,378,391],"problems.":[18],"Our":[19],"main":[20,305],"contribution":[21],"is":[22,82],"a":[23,35,41,47,55,83,107,113,128,169,183,198,217,300,307,321,327,344,377],"algorithm":[25,309],"that,":[26,310,364],"given":[27,311],"an":[28,72,101,138,164,177,208,312,337],"unweighted":[29,102,178],"undirected":[30,313],"graph":[31,103,180,315],"G":[32,61,104,120,134,181,190,204,316,350],"embedded":[33,105],"on":[34,106,263,287,373],"surface":[36,108],"of":[37,50,63,79,85,88,109,172,243,272,294,303,330,352,368],"genus":[38,110],"g":[39,67,111,151],"designated":[42,322],"face":[43,323],"f":[44,89,324,334,362,374,386],"bounded":[45,325],"by":[46,269,291,326],"simple":[48,328],"cycle":[49,329],"length":[51],"k":[52,69],",":[53,375],"uncovers":[54,343],"set":[56,78,115,129,170,185,199,345,367],"F":[57,130,200,261,346],"\u2286":[58,117,131,187,201,347],"E":[59,132,154,202,348],"(":[60,119,133,155,189,203,333,349,361,385],")":[62,135,205,230,282,351,359,363,387],"size":[64,148,234,271,293],"polynomial":[65,125,149,195,235,251],"in":[66,124,150,194,225,236],"contains":[71,137,207,376],"tree":[75,141,274],"for":[76,143,163,168,253,279,365],"any":[77,221,366],"terminals":[80,227],"subset":[84],"the":[86,241,249,270,273,292,295,389],"vertices":[87],".":[90],"apply":[92],"this":[93],"general":[94],"theorem":[95],"prove":[97],"that:":[98],"\u2014":[99,158,175],"Given":[100,176],"terminal":[114,173,184,369],"S":[116,144,171,186,215,229,254,259],"V":[118,188],"),":[121,191,335],"one":[122,192],"can":[123,193],"time":[126,196],"find":[127,197],"T":[142,156,256],"has":[147,233],"|":[153,237],")|.":[157],"An":[159],"analogous":[160],"result":[161],"holds":[162],"forest":[167,379],"pairs.":[174],"(edge)":[210],"multiway":[211],"cut":[212],"C":[213,238,285],"separating":[214],"(i.e.,":[216],"cutset":[218],"intersects":[220],"path":[222],"with":[223,317],"endpoints":[224],"different":[226],"from":[228,388],"|.":[239],"In":[240],"language":[242],"parameterized":[244],"complexity,":[245],"these":[246],"results":[247],"imply":[248],"first":[250],"kernels":[252],"teiner":[255,260],"ree":[257],"orest":[262],"(parameterized":[268,290],"forest,":[276],"respectively)":[277],"(E":[280],"dge":[281],"M":[283],"ultiway":[284],"ut":[286],"cutset).":[296],"Additionally,":[297],"we":[298],"obtain":[299],"weighted":[301],"variant":[302],"our":[304],"contribution:":[306],"plane":[314],"positive":[318],"edge":[319],"weights,":[320],"weight":[331,354],"w":[332,360,384],"accuracy":[338],"parameter":[339],"\u03b5":[340,383],">":[341],"0,":[342],"total":[353],"at":[355],"most":[356],"poly(\u03b5":[357],"-1":[358],"pairs":[370],"lie":[372],"within":[380],"additive":[381],"error":[382],"forest.":[392]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}