{"id":"https://openalex.org/W1982089707","doi":"https://doi.org/10.1145/1806689.1806720","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":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W1982089707","doi":"https://doi.org/10.1145/1806689.1806720","mag":"1982089707"},"language":"en","primary_location":{"id":"doi:10.1145/1806689.1806720","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806720","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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, Princeton, NJ, USA","Princeton University , Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University , Princeton, NJ, USA","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/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"MohammadTaghi Hajiaghayi","raw_affiliation_strings":["AT&T Labs -- Research, Florham Park, NJ, USA","AT&T Labs---Research, Florham Park, NJ, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Labs -- Research, Florham Park, NJ, USA","institution_ids":["https://openalex.org/I1283103587"]},{"raw_affiliation_string":"AT&T Labs---Research, Florham Park, NJ, USA#TAB#","institution_ids":["https://openalex.org/I1283103587"]}]},{"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/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.8879,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.97797989,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"211","last_page":"220"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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.9991999864578247,"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.9973999857902527,"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.986299991607666,"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.9278795719146729},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7746927738189697},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.7544751763343811},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.706874430179596},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.6696094274520874},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6671965718269348},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.583545446395874},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5832386016845703},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5502960681915283},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5241459012031555},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5151130557060242},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49601230025291443},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.48040083050727844},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.47203198075294495},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18802008032798767},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07079300284385681}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9278795719146729},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7746927738189697},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.7544751763343811},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.706874430179596},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.6696094274520874},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6671965718269348},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.583545446395874},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5832386016845703},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5502960681915283},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5241459012031555},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5151130557060242},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49601230025291443},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.48040083050727844},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.47203198075294495},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18802008032798767},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07079300284385681},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1806689.1806720","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806720","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.174.1223","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.1223","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-math.mit.edu/%7Ehajiagha/planarforest.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.725.2782","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.725.2782","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bme.hu/%7Edmarx/papers/bateni-stoc2010-steiner.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.748.1004","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.748.1004","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0911.5143.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","score":0.6600000262260437,"id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"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/W1982089707","https://openalex.org/W1990317614","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/W2065166038","https://openalex.org/W2070664846","https://openalex.org/W2078008627","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/W2245114686","https://openalex.org/W2499579848","https://openalex.org/W2949199930","https://openalex.org/W3021837896","https://openalex.org/W4387627319","https://openalex.org/W6651557389"],"related_works":["https://openalex.org/W2027388354","https://openalex.org/W2084535634","https://openalex.org/W2949315077","https://openalex.org/W1572255008","https://openalex.org/W2584271047","https://openalex.org/W2091382007","https://openalex.org/W4285428820","https://openalex.org/W143512583","https://openalex.org/W2803227791","https://openalex.org/W1538433552"],"abstract_inverted_index":{"We":[0,143],"give":[1],"the":[2,9,43,55,67,90,140,184],"first":[3,26],"polynomial-time":[4],"approximation":[5,134],"scheme":[6],"(PTAS)":[7],"for":[8,37,103,125,155],"Steiner":[10,34,83,104,112,147,181],"forest":[11,35,105,113,148,182],"problem":[12],"on":[13,19,106,117,139],"planar":[14,190],"graphs":[15,20,107,118,128,157],"and,":[16],"more":[17],"generally,":[18],"of":[21,42,108,119,133,159,168,180,186],"bounded":[22,109,126,187,193],"genus.":[23],"As":[24],"a":[25,33,46,80,101,130,165],"step,":[27],"we":[28],"show":[29,145],"how":[30],"to":[31,64],"build":[32],"spanner":[36],"such":[38],"graphs.":[39,195],"The":[40],"crux":[41],"process":[44],"is":[45,100,114],"clustering":[47,51],"procedure":[48],"called":[49],"prize-collecting":[50],"that":[52,146],"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,152,183],"different":[70],"far":[73],"from":[74],"each":[75],"other.":[76],"Each":[77],"subinstance":[78],"has":[79],"relatively":[81],"inexpensive":[82],"tree":[84,141],"connecting":[85],"all":[86],"its":[87],"terminals,":[88],"and":[89,136,171,192],"can":[92,149],"be":[93,150],"solved":[94,151],"(almost)":[95],"separately.":[96],"Another":[97],"building":[98],"block":[99],"PTAS":[102,124],"treewidth.":[110],"Surprisingly,":[111],"NP-hard":[115],"even":[116],"treewidth":[120,127,160,188],"3.":[121],"Therefore,":[122],"our":[123,176],"needs":[129],"nontrivial":[131],"combination":[132,167],"arguments":[135],"dynamic":[137,169],"programming":[138,170],"decomposition.":[142],"further":[144],"polynomial":[153],"time":[154],"series-parallel":[156],"(graphs":[158],"at":[161],"most":[162],"two)":[163],"by":[164],"novel":[166],"minimum":[172],"cut":[173],"computations,":[174],"completing":[175],"thorough":[177],"complexity":[178],"study":[179],"range":[185],"graphs,":[189,191],"genus":[194]},"counts_by_year":[{"year":2022,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}