{"id":"https://openalex.org/W2141156487","doi":"https://doi.org/10.1145/2650183","title":"Approximating Rooted Steiner Networks","display_name":"Approximating Rooted Steiner Networks","publication_year":2014,"publication_date":"2014-10-30","ids":{"openalex":"https://openalex.org/W2141156487","doi":"https://doi.org/10.1145/2650183","mag":"2141156487"},"language":"en","primary_location":{"id":"doi:10.1145/2650183","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2650183","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/A5046805470","display_name":"Joseph Cheriyan","orcid":"https://orcid.org/0000-0003-0316-7650"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Joseph Cheriyan","raw_affiliation_strings":["University of Waterloo, Canada"],"affiliations":[{"raw_affiliation_string":"University of Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005632876","display_name":"Bundit Laekhanukit","orcid":"https://orcid.org/0000-0002-4476-8914"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Bundit Laekhanukit","raw_affiliation_strings":["McGill University, Canada"],"affiliations":[{"raw_affiliation_string":"McGill University, Canada","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019615126","display_name":"Guyslain Naves","orcid":"https://orcid.org/0000-0001-5460-9995"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Guyslain Naves","raw_affiliation_strings":["McGill University, Canada"],"affiliations":[{"raw_affiliation_string":"McGill University, Canada","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027727214","display_name":"Adrian Vetta","orcid":"https://orcid.org/0000-0002-2213-4937"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Adrian Vetta","raw_affiliation_strings":["McGill University, Canada"],"affiliations":[{"raw_affiliation_string":"McGill University, Canada","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5046805470"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":1.4721,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.83445743,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"11","issue":"2","first_page":"1","last_page":"22"},"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.9998999834060669,"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.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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/T10083","display_name":"Graphene research and applications","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials 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.8752413988113403},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7351300120353699},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6500937938690186},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6200859546661377},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5946735143661499},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.569344162940979},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.48730742931365967},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46376466751098633},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4517759680747986},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.39511072635650635},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.23829856514930725},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22972670197486877}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8752413988113403},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7351300120353699},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6500937938690186},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6200859546661377},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5946735143661499},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.569344162940979},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.48730742931365967},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46376466751098633},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4517759680747986},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.39511072635650635},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.23829856514930725},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22972670197486877},{"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/2650183","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2650183","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":[{"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land","score":0.5099999904632568}],"awards":[{"id":"https://openalex.org/G8574914334","display_name":null,"funder_award_id":"No. OGP0138432 and No. 28833","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W200056458","https://openalex.org/W1899379166","https://openalex.org/W1970259241","https://openalex.org/W1987353362","https://openalex.org/W1996668544","https://openalex.org/W2003753063","https://openalex.org/W2009976792","https://openalex.org/W2019123979","https://openalex.org/W2019578639","https://openalex.org/W2022092881","https://openalex.org/W2052656799","https://openalex.org/W2052687843","https://openalex.org/W2121085314","https://openalex.org/W2143481766","https://openalex.org/W2143996311","https://openalex.org/W2148352980","https://openalex.org/W2157247984","https://openalex.org/W2167621755","https://openalex.org/W2172955861","https://openalex.org/W2177638926","https://openalex.org/W2295961103","https://openalex.org/W2611804663","https://openalex.org/W2953314116","https://openalex.org/W4205585032","https://openalex.org/W4238882150","https://openalex.org/W4300550233","https://openalex.org/W6844382842"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W132011890","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"],"abstract_inverted_index":{"The":[0,25,35],"Directed":[1],"Steiner":[2,51],"Tree":[3],"(DST)":[4],"problem":[5,9,20,26,36,99],"is":[6,33,43,57],"a":[7,104,125],"cornerstone":[8],"in":[10,100],"network":[11],"design.":[12],"We":[13],"focus":[14],"on":[15,127],"the":[16,19,49,55,67,95,116,128,132,138],"generalization":[17],"of":[18,131,137],"with":[21,27,37],"higher":[22],"connectivity":[23],"requirements.":[24],"one":[28,38],"root":[29,39],"and":[30,40,54,78],"two":[31],"sinks":[32,42],"APX-hard.":[34],"many":[41],"as":[44,48,62,66],"hard":[45,63],"to":[46,60,64,81],"approximate":[47,65],"directed":[50,139],"forest":[52],"problem,":[53],"latter":[56],"well":[58],"known":[59],"be":[61],"label":[68],"cover":[69],"problem.":[70,121,143],"Utilizing":[71],"previous":[72],"techniques,":[73],"we":[74,85,106,123],"strengthen":[75],"these":[76],"results":[77],"extend":[79],"them":[80],"undirected":[82,101,117],"graphs.":[83,102],"Specifically,":[84],"give":[86,124],"an":[87,108],"\u03a9(":[88,109],"k":[89,97,110,119,141],"\u03f5":[90,111],")":[91,112],"hardness":[92,113],"bound":[93,114],"for":[94,115],"rooted":[96,140],"-connectivity":[98,120,142],"As":[103],"consequence,":[105],"obtain":[107],"subset":[118],"Additionally,":[122],"result":[126],"integrality":[129],"ratio":[130],"natural":[133],"linear":[134],"programming":[135],"relaxation":[136]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-09T08:58:05.943551","created_date":"2025-10-10T00:00:00"}