{"id":"https://openalex.org/W4410156455","doi":"https://doi.org/10.1145/3734525","title":"A \\(\\boldsymbol{O}(\\textbf{log}\\,\\boldsymbol{k})\\) -Approximation for <scp>Directed Steiner Tree</scp> in Planar Graphs","display_name":"A \\(\\boldsymbol{O}(\\textbf{log}\\,\\boldsymbol{k})\\) -Approximation for <scp>Directed Steiner Tree</scp> in Planar Graphs","publication_year":2025,"publication_date":"2025-05-07","ids":{"openalex":"https://openalex.org/W4410156455","doi":"https://doi.org/10.1145/3734525"},"language":"en","primary_location":{"id":"doi:10.1145/3734525","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3734525","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/A5020188279","display_name":"Zachary Friggstad","orcid":"https://orcid.org/0000-0003-4039-3235"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Zachary Friggstad","raw_affiliation_strings":["Computing Science, University of Alberta, Edmonton, Alberta, Canada","University of Alberta, Canada"],"raw_orcid":"https://orcid.org/0000-0003-4039-3235","affiliations":[{"raw_affiliation_string":"Computing Science, University of Alberta, Edmonton, Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"University of Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044624091","display_name":"Ramin Mousavi","orcid":"https://orcid.org/0000-0001-6843-6044"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ramin Mousavi","raw_affiliation_strings":["Computing Science, University of Alberta, Edmonton, Alberta, Canada","University of Alberta, Canada"],"raw_orcid":"https://orcid.org/0000-0001-6843-6044","affiliations":[{"raw_affiliation_string":"Computing Science, University of Alberta, Edmonton, Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"University of Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10083917,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"4","first_page":"1","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9991000294685364,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8707244396209717},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7853876352310181},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6966161727905273},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5252627730369568},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4807603061199188},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4670350253582001},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4615253508090973},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4561346173286438},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4491531252861023},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.261709988117218},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.22557252645492554}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8707244396209717},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7853876352310181},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6966161727905273},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5252627730369568},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4807603061199188},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4670350253582001},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4615253508090973},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4561346173286438},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4491531252861023},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.261709988117218},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.22557252645492554},{"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/3734525","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3734525","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W109985799","https://openalex.org/W1975361422","https://openalex.org/W1976584101","https://openalex.org/W1998126097","https://openalex.org/W2005771129","https://openalex.org/W2009976792","https://openalex.org/W2012130001","https://openalex.org/W2035409201","https://openalex.org/W2038643780","https://openalex.org/W2039298646","https://openalex.org/W2045749371","https://openalex.org/W2070664846","https://openalex.org/W2089847997","https://openalex.org/W2096304547","https://openalex.org/W2150410057","https://openalex.org/W2295961103","https://openalex.org/W2570206580","https://openalex.org/W2949193238","https://openalex.org/W3215027038","https://openalex.org/W4210896998","https://openalex.org/W4281676033","https://openalex.org/W4400377759"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","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/W3216105633"],"abstract_inverted_index":{"We":[0,29],"present":[1],"a":[2,43],"\\(O(\\log":[3],"k)\\)":[4,45],"-approximation":[5,46],"for":[6,47,50],"both":[7],"the":[8,25,56],"edge-weighted":[9],"and":[10],"node-weighted":[11],"versions":[12],"of":[13,27,58],"Directed":[14,35],"Steiner":[15,36],"Tree":[16,37],"in":[17,39],"planar":[18,48],"graphs":[19,49],"where":[20],"\\(":[21,52],"k":[22],"\\)":[23,54],"is":[24,55],"number":[26,57],"terminals.":[28],"extend":[30],"our":[31],"approach":[32],"to":[33],"Multi-Rooted":[34],",":[38],"which":[40,51],"we":[41],"get":[42],"\\(O(R+\\log":[44],"R":[53],"roots.":[59]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-05-08T00:00:00"}