{"id":"https://openalex.org/W1972906866","doi":"https://doi.org/10.1145/2629654","title":"A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest","display_name":"A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest","publication_year":2015,"publication_date":"2015-01-13","ids":{"openalex":"https://openalex.org/W1972906866","doi":"https://doi.org/10.1145/2629654","mag":"1972906866"},"language":"en","primary_location":{"id":"doi:10.1145/2629654","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2629654","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/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Glencora Borradaile","raw_affiliation_strings":["Oregon State University","Oregon State University>"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Oregon State University","institution_ids":["https://openalex.org/I131249849"]},{"raw_affiliation_string":"Oregon State University>","institution_ids":["https://openalex.org/I131249849"]}]},{"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 N. Klein","raw_affiliation_strings":["Brown University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brown University","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":[],"countries":[],"is_corresponding":false,"raw_author_name":"Claire Mathieu","raw_affiliation_strings":["Ecole Normale Sup\u00e9rieure"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ecole Normale Sup\u00e9rieure","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3359,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.81765835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"11","issue":"3","first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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.993399977684021,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9932000041007996,"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.7653007507324219},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.7538881897926331},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7192959785461426},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.7143180966377258},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.7136775851249695},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6251786947250366},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.589896559715271},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5833356976509094},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5048261284828186},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45598912239074707},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4353156089782715},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4198286533355713},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4044704735279083},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1168287992477417},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08439883589744568}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7653007507324219},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.7538881897926331},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7192959785461426},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.7143180966377258},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.7136775851249695},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6251786947250366},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.589896559715271},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5833356976509094},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5048261284828186},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45598912239074707},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4353156089782715},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4198286533355713},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4044704735279083},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1168287992477417},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08439883589744568}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2629654","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2629654","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":[{"display_name":"Life in Land","score":0.6899999976158142,"id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1520111182","https://openalex.org/W1565699018","https://openalex.org/W1572973141","https://openalex.org/W1977541023","https://openalex.org/W1982089707","https://openalex.org/W1994248285","https://openalex.org/W1995473411","https://openalex.org/W1995718774","https://openalex.org/W2007279610","https://openalex.org/W2011823863","https://openalex.org/W2020284736","https://openalex.org/W2025299767","https://openalex.org/W2029777782","https://openalex.org/W2045749371","https://openalex.org/W2065166038","https://openalex.org/W2070664846","https://openalex.org/W2082176459","https://openalex.org/W2089016801","https://openalex.org/W2110367141","https://openalex.org/W2165142526","https://openalex.org/W2561675875","https://openalex.org/W2611804663"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W3184075718","https://openalex.org/W2995411114","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2011703460","https://openalex.org/W1998126097"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,45],"randomized":[3],"O":[4],"(":[5],"n":[6,8,29],"polylog":[7],")-time":[9],"approximation":[10,49],"scheme":[11,43],"for":[12],"the":[13,18,32,51],"Steiner":[14],"forest":[15,53],"problem":[16],"in":[17,31],"Euclidean":[19],"plane.":[20],"For":[21],"every":[22,56],"fixed":[23],"\u03f5":[24],">":[25],"0":[26],"and":[27],"given":[28],"terminals":[30],"plane":[33],"with":[34],"connection":[35],"requests":[36],"between":[37],"some":[38],"pairs":[39],"of":[40,59],"terminals,":[41],"our":[42],"finds":[44],"(1":[46],"+":[47],"\u03f5)":[48],"to":[50],"minimum-length":[52],"that":[54],"connects":[55],"requested":[57],"pair":[58],"terminals.":[60]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}