{"id":"https://openalex.org/W2570206580","doi":"https://doi.org/10.1145/2027216.2027219","title":"Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth","display_name":"Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2570206580","doi":"https://doi.org/10.1145/2027216.2027219","mag":"2570206580"},"language":"en","primary_location":{"id":"doi:10.1145/2027216.2027219","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2027216.2027219","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","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/A5113873446","display_name":"MohammadHossein Bateni","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammadhossein Bateni","raw_affiliation_strings":["Princeton University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammadtaghi Hajiaghayi","raw_affiliation_strings":["University of Maryland at College Park"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland at College Park","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Humboldt-Universit\u00e4t zu Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Humboldt-Universit\u00e4t zu Berlin","institution_ids":["https://openalex.org/I39343248"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.5677,"has_fulltext":false,"cited_by_count":88,"citation_normalized_percentile":{"value":0.95259883,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"58","issue":"5","first_page":"1","last_page":"37"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994999766349792,"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.9983999729156494,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.9285460710525513},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7733466029167175},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.7492067813873291},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7016833424568176},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.6571287512779236},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.6546323299407959},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6231737732887268},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.6027913689613342},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5702462792396545},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.509589433670044},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5067804455757141},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4973657429218292},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.47269678115844727},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.43547922372817993},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1857457160949707},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06692945957183838}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9285460710525513},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7733466029167175},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.7492067813873291},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7016833424568176},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.6571287512779236},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.6546323299407959},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6231737732887268},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.6027913689613342},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5702462792396545},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.509589433670044},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5067804455757141},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4973657429218292},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.47269678115844727},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.43547922372817993},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1857457160949707},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06692945957183838},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2027216.2027219","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2027216.2027219","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6700000166893005,"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15"}],"awards":[{"id":"https://openalex.org/G4117300866","display_name":null,"funder_award_id":"832797","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4425768753","display_name":"CAREER: Foundations of Network Design: Real-World Networks, Special Topologies, and Game Theory","funder_award_id":"1053605","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4547255915","display_name":null,"funder_award_id":"OTKA 67651","funder_id":"https://openalex.org/F4320321994","funder_display_name":"Hungarian Scientific Research Fund"},{"id":"https://openalex.org/G6489740434","display_name":null,"funder_award_id":"CCF 0832797","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G6608289065","display_name":null,"funder_award_id":"CCF-0205594CCF-0426582","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G7478979111","display_name":null,"funder_award_id":"528414","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7727331209","display_name":null,"funder_award_id":"CCF-0237113","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W109985799","https://openalex.org/W171155747","https://openalex.org/W594463866","https://openalex.org/W1185775471","https://openalex.org/W1485792125","https://openalex.org/W1497625304","https://openalex.org/W1535706250","https://openalex.org/W1607394607","https://openalex.org/W1965737603","https://openalex.org/W1974098993","https://openalex.org/W1974358136","https://openalex.org/W1991055327","https://openalex.org/W1994248285","https://openalex.org/W1995473411","https://openalex.org/W2001139415","https://openalex.org/W2003882909","https://openalex.org/W2011823863","https://openalex.org/W2012130001","https://openalex.org/W2020112047","https://openalex.org/W2026271416","https://openalex.org/W2029448190","https://openalex.org/W2029777782","https://openalex.org/W2030458698","https://openalex.org/W2039298646","https://openalex.org/W2045749371","https://openalex.org/W2047861451","https://openalex.org/W2052588711","https://openalex.org/W2070664846","https://openalex.org/W2078008627","https://openalex.org/W2082176459","https://openalex.org/W2087083200","https://openalex.org/W2110367141","https://openalex.org/W2114997377","https://openalex.org/W2129845900","https://openalex.org/W2132169470","https://openalex.org/W2150855695","https://openalex.org/W2156760067","https://openalex.org/W2165142526","https://openalex.org/W2166566648","https://openalex.org/W2168958045","https://openalex.org/W2176537723","https://openalex.org/W3021837896","https://openalex.org/W4387627319","https://openalex.org/W6633714127","https://openalex.org/W6685514140"],"related_works":["https://openalex.org/W1976463682","https://openalex.org/W2012687409","https://openalex.org/W2082176459","https://openalex.org/W2113901576","https://openalex.org/W4285428820","https://openalex.org/W4297435153","https://openalex.org/W2949199930","https://openalex.org/W2091382007","https://openalex.org/W2570206580","https://openalex.org/W3134208201"],"abstract_inverted_index":{"We":[0,142],"give":[1],"the":[2,9,43,55,67,90,139,183],"first":[3,26],"polynomial-time":[4],"approximation":[5,133],"scheme":[6],"(PTAS)":[7],"for":[8,37,103,125,154],"Steiner":[10,34,83,104,112,146,180],"forest":[11,35,105,113,147,181],"problem":[12],"on":[13,19,106,117,138],"planar":[14,188],"graphs":[15,20,107,118,127,156],"and,":[16],"more":[17],"generally,":[18],"of":[21,42,108,119,132,158,167,179,185],"bounded":[22,109],"genus.":[23],"As":[24],"a":[25,33,46,80,101,129,164],"step,":[27],"we":[28],"show":[29,144],"how":[30],"to":[31,64],"build":[32],"spanner":[36],"such":[38],"graphs.":[39,192],"The":[40],"crux":[41],"process":[44],"is":[45,100,114],"clustering":[47,51],"procedure":[48],"called":[49],"prize-collecting":[50],"that":[52,145],"breaks":[53],"down":[54],"input":[56],"instance":[57],"into":[58],"separate":[59],"subinstances":[60,71,91],"which":[61],"are":[62,72],"easier":[63],"handle;":[65],"moreover,":[66],"terminals":[68],"in":[69,151,182],"different":[70],"far":[73],"from":[74],"each":[75],"other.":[76],"Each":[77],"subinstance":[78],"has":[79],"relatively":[81],"inexpensive":[82],"tree":[84,140],"connecting":[85],"all":[86],"its":[87],"terminals,":[88],"and":[89,135,170,190],"can":[92,148],"be":[93,149],"solved":[94,150],"(almost)":[95],"separately.":[96],"Another":[97],"building":[98],"block":[99],"PTAS":[102,124],"treewidth.":[110],"Surprisingly,":[111],"NP-hard":[115],"even":[116],"treewidth":[120,159],"3.":[121],"Therefore,":[122],"our":[123,175],"bounded-treewidth":[126,186],"needs":[128],"nontrivial":[130],"combination":[131,166],"arguments":[134],"dynamic":[136,168],"programming":[137,169],"decomposition.":[141],"further":[143],"polynomial":[152],"time":[153],"series-parallel":[155],"(graphs":[157],"at":[160],"most":[161],"two)":[162],"by":[163],"novel":[165],"minimum":[171],"cut":[172],"computations,":[173],"completing":[174],"thorough":[176],"complexity":[177],"study":[178],"range":[184],"graphs,":[187,189],"bounded-genus":[191]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-22T08:00:12.763002","created_date":"2025-10-10T00:00:00"}