{"id":"https://openalex.org/W2963277542","doi":"https://doi.org/10.1145/3371389","title":"Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces","display_name":"Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces","publication_year":2020,"publication_date":"2020-06-06","ids":{"openalex":"https://openalex.org/W2963277542","doi":"https://doi.org/10.1145/3371389","mag":"2963277542"},"language":"en","primary_location":{"id":"doi:10.1145/3371389","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3371389","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":true,"oa_status":"green","oa_url":"https://dspace.library.uu.nl/handle/1874/378087","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057527289","display_name":"\u202aS\u00e1ndor Kisfaludi-Bak","orcid":"https://orcid.org/0000-0002-6856-2902"},"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":true,"raw_author_name":"S\u00e1ndor Kisfaludi-Bak","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarland Informatics Campus, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarland Informatics Campus, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["Eindhoven University of Technology, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-1848-0076","affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"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":["Utrecht University, Utrecht, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057527289"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":0.583,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.7189427,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"16","issue":"3","first_page":"1","last_page":"30"},"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.9995999932289124,"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.9993000030517578,"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/combinatorics","display_name":"Combinatorics","score":0.7459619045257568},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7080921530723572},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6335634589195251},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5299283862113953},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5104283690452576},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4833831191062927},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4772108197212219},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45998141169548035},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44065260887145996},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.425632506608963},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.25035303831100464}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7459619045257568},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7080921530723572},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6335634589195251},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5299283862113953},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5104283690452576},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4833831191062927},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4772108197212219},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45998141169548035},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44065260887145996},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.425632506608963},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25035303831100464}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/3371389","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3371389","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:912102","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=912102","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:dspace.library.uu.nl:1874/378087","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/378087","pdf_url":null,"source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Part of book"},{"id":"pmh:oai:dspace.library.uu.nl:1874/470385","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/470385","pdf_url":null,"source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:library.tue.nl:912102","is_oa":false,"landing_page_url":"http://repository.tue.nl/912102","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:pure.mpg.de:item_3266063","is_oa":false,"landing_page_url":"http://hdl.handle.net/21.11116/0000-0007-7796-A","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"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","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:dspace.library.uu.nl:1874/378087","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/378087","pdf_url":null,"source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Part of book"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7306725599","display_name":null,"funder_award_id":"no. 024.002.003 and no. 639.021.438","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W93474319","https://openalex.org/W95416648","https://openalex.org/W1190319202","https://openalex.org/W1531591475","https://openalex.org/W1572973141","https://openalex.org/W1791386552","https://openalex.org/W1986916307","https://openalex.org/W1989626562","https://openalex.org/W1996668544","https://openalex.org/W2003753063","https://openalex.org/W2007069176","https://openalex.org/W2017713020","https://openalex.org/W2031229603","https://openalex.org/W2031493401","https://openalex.org/W2039202283","https://openalex.org/W2040444410","https://openalex.org/W2045326192","https://openalex.org/W2048068744","https://openalex.org/W2065759448","https://openalex.org/W2066137891","https://openalex.org/W2071945466","https://openalex.org/W2097782835","https://openalex.org/W2155235203","https://openalex.org/W2158584754","https://openalex.org/W2163668690","https://openalex.org/W2570206580","https://openalex.org/W2899946382","https://openalex.org/W2962856411","https://openalex.org/W2963232826","https://openalex.org/W3121437753","https://openalex.org/W4210733105","https://openalex.org/W4213060883","https://openalex.org/W4237504351","https://openalex.org/W4297484378"],"related_works":["https://openalex.org/W2108770488","https://openalex.org/W2021517364","https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W2089134982","https://openalex.org/W3100139999","https://openalex.org/W2113270940"],"abstract_inverted_index":{"The":[0],"S":[1,151,199],"TEINER":[2,152,200],"T":[3,153,201],"REE":[4,154,202],"problem":[5,27,98],"is":[6,45,78,180,187],"one":[7],"of":[8,25,29,38,50,53,89,118,120,135,177],"the":[9,43,51,75,87,97,116,121,125,163,174,210],"most":[10],"fundamental":[11],"NP-complete":[12],"problems,":[13],"as":[14],"it":[15],"models":[16],"many":[17],"network":[18],"design":[19],"problems.":[20],"Recall":[21],"that":[22,57,96,173,185],"an":[23,103,146],"instance":[24],"this":[26,136,142],"consists":[28],"a":[30,36,48],"graph":[31,52,77],"with":[32,155,162],"edge":[33],"weights":[34],"and":[35,80,109],"subset":[37],"vertices":[39,119],"(often":[40],"called":[41],"terminals);":[42],"goal":[44],"to":[46],"find":[47],"subtree":[49],"minimum":[54],"total":[55],"weight":[56],"connects":[58],"all":[59,81],"terminals.":[60],"A":[61],"seminal":[62],"paper":[63],"by":[64,86,102],"Erickson":[65,92],"et":[66,93],"al.":[67,94],"[Math.":[68],"Oper.":[69],"Res.,":[70],"1987{":[71],"considers":[72],"instances":[73],"where":[74,113],"underlying":[76],"planar":[79],"terminals":[82],"can":[83,99],"be":[84,100],"covered":[85],"boundary":[88],"k":[90,191],"faces.":[91],"show":[95,172],"solved":[101],"algorithm":[104,147,179,195],"using":[105,166],"n":[106,110,114,160,193],"O(k)":[107,111,159],"time":[108,157,176],"space,":[112],"denotes":[115],"number":[117],"input":[122],"graph.":[123],"In":[124,141],"past":[126],"30":[127],"years":[128],"there":[129,186],"has":[130],"been":[131],"no":[132,188],"significant":[133],"improvement":[134],"algorithm,":[137],"despite":[138],"several":[139],"efforts.":[140],"work,":[143],"we":[144,171],"give":[145],"for":[148,196,203],"P":[149,197],"LANAR":[150,198],"running":[156,175],"2":[158],"O(\u221ak)":[161],"above":[164],"parameterization,":[165],"only":[167],"polynomial":[168],"space.":[169],"Furthermore,":[170],"our":[178],"almost":[181],"tight:":[182],"We":[183],"prove":[184],"f":[189,207],"(":[190],")":[192],"o(\u221ak)":[194],"any":[204],"computable":[205],"function":[206],",":[208],"unless":[209],"Exponential":[211],"Time":[212],"Hypothesis":[213],"fails.":[214]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}