{"id":"https://openalex.org/W2045749371","doi":"https://doi.org/10.1145/1541885.1541892","title":"An <i>O</i> ( <i>n</i> log <i>n</i> ) approximation scheme for Steiner tree in planar graphs","display_name":"An <i>O</i> ( <i>n</i> log <i>n</i> ) approximation scheme for Steiner tree in planar graphs","publication_year":2009,"publication_date":"2009-07-01","ids":{"openalex":"https://openalex.org/W2045749371","doi":"https://doi.org/10.1145/1541885.1541892","mag":"2045749371"},"language":"en","primary_location":{"id":"doi:10.1145/1541885.1541892","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1541885.1541892","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/A5108529502","display_name":"Glencora Borradaile","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Glencora Borradaile","raw_affiliation_strings":["Brown University, Providence, RI","Brown University, Providence, RI,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brown University, Providence, RI","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Brown University, Providence, RI,","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035567880","display_name":"Philip N. Klein","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Philip Klein","raw_affiliation_strings":["Brown University, Providence, RI","Brown University, Providence, RI,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brown University, Providence, RI","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Brown University, Providence, RI,","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035864448","display_name":"Claire Mathieu","orcid":"https://orcid.org/0000-0002-0517-112X"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Claire Mathieu","raw_affiliation_strings":["Brown University, Providence, RI","Brown University, Providence, RI,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brown University, Providence, RI","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Brown University, Providence, RI,","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I27804330"],"apc_list":null,"apc_paid":null,"fwci":6.0054,"has_fulltext":false,"cited_by_count":92,"citation_normalized_percentile":{"value":0.96451249,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"5","issue":"3","first_page":"1","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9026927947998047},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7515536546707153},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.716720700263977},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.6216875910758972},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.602350115776062},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5960642099380493},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5607758164405823},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5602930784225464},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5342406630516052},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5143371820449829},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49322837591171265},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45546823740005493},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4228364825248718},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.23291859030723572},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17209070920944214},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.16614317893981934},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.1508437693119049},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.14449450373649597}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9026927947998047},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7515536546707153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.716720700263977},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.6216875910758972},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.602350115776062},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5960642099380493},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5607758164405823},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5602930784225464},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5342406630516052},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5143371820449829},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49322837591171265},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45546823740005493},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4228364825248718},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.23291859030723572},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17209070920944214},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.16614317893981934},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.1508437693119049},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.14449450373649597},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1541885.1541892","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1541885.1541892","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/G8900470265","display_name":null,"funder_award_id":"CCF-0635089","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"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":43,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W109985799","https://openalex.org/W1485792125","https://openalex.org/W1535706250","https://openalex.org/W1550399701","https://openalex.org/W1572973141","https://openalex.org/W1966100573","https://openalex.org/W1975290397","https://openalex.org/W1987374783","https://openalex.org/W1990317614","https://openalex.org/W1993553699","https://openalex.org/W1994248285","https://openalex.org/W1995473411","https://openalex.org/W2003882909","https://openalex.org/W2009580398","https://openalex.org/W2012130001","https://openalex.org/W2020112047","https://openalex.org/W2020284736","https://openalex.org/W2031493401","https://openalex.org/W2039298646","https://openalex.org/W2042509875","https://openalex.org/W2045729188","https://openalex.org/W2062254875","https://openalex.org/W2065166038","https://openalex.org/W2066137891","https://openalex.org/W2070664846","https://openalex.org/W2071945466","https://openalex.org/W2078008627","https://openalex.org/W2078443814","https://openalex.org/W2110367141","https://openalex.org/W2145145566","https://openalex.org/W2150855695","https://openalex.org/W2156760067","https://openalex.org/W2163668690","https://openalex.org/W2165142526","https://openalex.org/W2561675875","https://openalex.org/W2562237129","https://openalex.org/W2570240585","https://openalex.org/W2612171860","https://openalex.org/W2762935521","https://openalex.org/W3127447045","https://openalex.org/W4243580053","https://openalex.org/W6730881501"],"related_works":["https://openalex.org/W974563791","https://openalex.org/W1980288485","https://openalex.org/W3195448539","https://openalex.org/W1992573093","https://openalex.org/W1992362850","https://openalex.org/W1585318792","https://openalex.org/W2162201886","https://openalex.org/W1998126097","https://openalex.org/W2112839770","https://openalex.org/W1983607113"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2],"Polynomial-Time":[3],"Approximation":[4],"Scheme":[5],"(PTAS)":[6],"for":[7],"the":[8],"Steiner":[9],"tree":[10],"problem":[11],"in":[12],"planar":[13],"graphs.":[14],"The":[15],"running":[16],"time":[17],"is":[18],"O":[19],"(":[20],"n":[21,23],"log":[22],").":[24]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":8}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}