{"id":"https://openalex.org/W2949193238","doi":"https://doi.org/10.1137/20m1312988","title":"$O(\\log^2{k}/\\log\\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm","display_name":"$O(\\log^2{k}/\\log\\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm","publication_year":2022,"publication_date":"2022-07-28","ids":{"openalex":"https://openalex.org/W2949193238","doi":"https://doi.org/10.1137/20m1312988","mag":"2949193238"},"language":"en","primary_location":{"id":"doi:10.1137/20m1312988","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1312988","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/21.11116/0000-0002-A880-F","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034276567","display_name":"Fabrizio Grandoni","orcid":"https://orcid.org/0000-0002-9676-4931"},"institutions":[{"id":"https://openalex.org/I15196421","display_name":"University of Applied Sciences and Arts of Southern Switzerland","ror":"https://ror.org/05ep8g269","country_code":"CH","type":"education","lineage":["https://openalex.org/I15196421"]},{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Fabrizio Grandoni","raw_affiliation_strings":["IDSIA, USI-SUPSI,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IDSIA, USI-SUPSI,","institution_ids":["https://openalex.org/I2614128279","https://openalex.org/I15196421"]}]},{"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/I181679659","display_name":"Shanghai University of Finance and Economics","ror":"https://ror.org/00wtvfq62","country_code":"CN","type":"education","lineage":["https://openalex.org/I181679659"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bundit Laekhanukit","raw_affiliation_strings":["Institute for Theoretical Computer Science, Shanghai University of Finance and Economics"],"raw_orcid":"https://orcid.org/0000-0002-4476-8914","affiliations":[{"raw_affiliation_string":"Institute for Theoretical Computer Science, Shanghai University of Finance and Economics","institution_ids":["https://openalex.org/I181679659"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100430766","display_name":"Shi Li","orcid":"https://orcid.org/0000-0001-9140-9415"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shi Li","raw_affiliation_strings":["Department of Computer Science and Engineering, University at Buffalo"],"raw_orcid":"https://orcid.org/0000-0001-9140-9415","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University at Buffalo","institution_ids":["https://openalex.org/I63190737"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034276567"],"corresponding_institution_ids":["https://openalex.org/I15196421","https://openalex.org/I2614128279"],"apc_list":null,"apc_paid":null,"fwci":0.9051,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.75588118,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"52","issue":"2","first_page":"STOC19","last_page":"298"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.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/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.7641323804855347},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7471148371696472},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7456833124160767},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6193264722824097},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.563873827457428},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5516878962516785},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4359278082847595},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42062097787857056},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3965829312801361}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7641323804855347},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7471148371696472},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7456833124160767},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6193264722824097},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.563873827457428},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5516878962516785},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4359278082847595},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42062097787857056},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3965829312801361},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/20m1312988","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1312988","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.mpg.de:item_3014334","is_oa":true,"landing_page_url":"http://hdl.handle.net/21.11116/0000-0002-A880-F","pdf_url":"http://hdl.handle.net/21.11116/0000-0002-A880-F","source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/workingPaper"},{"id":"pmh:oai:pure.mpg.de:item_3030504","is_oa":false,"landing_page_url":"http://hdl.handle.net/21.11116/0000-0003-1625-B","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"STOC '19","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:pure.mpg.de:item_3014334","is_oa":true,"landing_page_url":"http://hdl.handle.net/21.11116/0000-0002-A880-F","pdf_url":"http://hdl.handle.net/21.11116/0000-0002-A880-F","source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/workingPaper"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2477142964","display_name":null,"funder_award_id":"200020B 182865/1","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G3350261587","display_name":null,"funder_award_id":"CCF-1717134","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4252799795","display_name":"RCN: DIMACS/Simons Collaboration on Bridging Continuous and Discrete Optimization","funder_award_id":"1740425","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4304470407","display_name":null,"funder_award_id":"621/12","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G4925411279","display_name":null,"funder_award_id":"#621/12","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G5149950309","display_name":null,"funder_award_id":"CCF-1566356","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5259214660","display_name":null,"funder_award_id":"1717134","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7403389200","display_name":"Approximation Algorithms for Network Problems","funder_award_id":"159697","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G7406458852","display_name":"Approximation Algorithms for Network Problems II","funder_award_id":"182865","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G8029450420","display_name":null,"funder_award_id":"200021 159697/1","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G8196236912","display_name":null,"funder_award_id":"CCF-1740425","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8939654172","display_name":null,"funder_award_id":"61932002","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8947814559","display_name":null,"funder_award_id":"#4/11","funder_id":"https://openalex.org/F4320335016","funder_display_name":"Israeli Centers for Research Excellence"},{"id":"https://openalex.org/G993971353","display_name":null,"funder_award_id":"200021","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"},{"id":"https://openalex.org/F4320320946","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320324781","display_name":"Shanghai University of Finance and Economics","ror":"https://ror.org/00wtvfq62"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null},{"id":"https://openalex.org/F4320335016","display_name":"Israeli Centers for Research Excellence","ror":"https://ror.org/03w2v9593"},{"id":"https://openalex.org/F4320335787","display_name":"Fundamental Research Funds for the Central Universities","ror":null}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2949193238.pdf"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W47977097","https://openalex.org/W1495913768","https://openalex.org/W1582339485","https://openalex.org/W1586797185","https://openalex.org/W1863816925","https://openalex.org/W1972094496","https://openalex.org/W1976584101","https://openalex.org/W1977712294","https://openalex.org/W1986201860","https://openalex.org/W1997369416","https://openalex.org/W2005771129","https://openalex.org/W2009976792","https://openalex.org/W2014979132","https://openalex.org/W2016332468","https://openalex.org/W2037655022","https://openalex.org/W2039298646","https://openalex.org/W2082353536","https://openalex.org/W2114493937","https://openalex.org/W2141156487","https://openalex.org/W2151239055","https://openalex.org/W2154014787","https://openalex.org/W2156792066","https://openalex.org/W2228866060","https://openalex.org/W2295961103","https://openalex.org/W2412957665","https://openalex.org/W2552383377","https://openalex.org/W2610052675","https://openalex.org/W2626235428","https://openalex.org/W2902527724","https://openalex.org/W3002615297","https://openalex.org/W3030774092","https://openalex.org/W4232911618","https://openalex.org/W4234874860","https://openalex.org/W4241239065","https://openalex.org/W4243028800"],"related_works":["https://openalex.org/W2897253417","https://openalex.org/W2061945091","https://openalex.org/W2569940161","https://openalex.org/W3035891971","https://openalex.org/W2963258629","https://openalex.org/W2023646228","https://openalex.org/W4297749916","https://openalex.org/W2798395708","https://openalex.org/W2295961103","https://openalex.org/W2576011814"],"abstract_inverted_index":{"In":[0],"the":[1,63,71,74,86,100,107,120,135,149,158,179],"directed":[2,12,36,173],"Steiner":[3,137,155,174],"tree":[4,138],"(DST)":[5],"problem,":[6,133,144],"we":[7,98,146],"are":[8],"given":[9],"an":[10,45,131],"$n$-vertex":[11],"edge-weighted":[13],"graph,":[14],"a":[15,19,30,35],"root":[16],"$r$,":[17],"and":[18,67,69,79,157,164,186],"collection":[20],"of":[21,77,85,93,104,109,178],"$k$":[22],"terminal":[23],"nodes.":[24],"Our":[25,123],"goal":[26],"is":[27,118,125],"to":[28,40,130],"find":[29],"minimum-cost":[31],"subgraph":[32],"that":[33,51,114],"contains":[34],"path":[37],"from":[38],"$r$":[39],"every":[41],"terminal.":[42],"We":[43],"present":[44],"$O(\\log^2":[46],"k/\\log\\log{k})$-approximation":[47],"algorithm":[48,124],"for":[49,106,172],"DST":[50,129],"runs":[52],"in":[53,57,73,83,176],"quasi-polynomial":[54,110],"time,":[55],"i.e.,":[56],"time":[58,111],"$n^{{poly}\\log":[59],"(k)}$.":[60],"By":[61],"assuming":[62],"projection":[64],"game":[65],"conjecture":[66],"${NP}\\not\\subseteq{\\bigcap}_{0<\\epsilon<1}{ZPTIME}(2^{n^\\epsilon})$":[68],"adjusting":[70],"parameters":[72],"hardness":[75],"result":[76],"[Halperin":[78],"Krauthgamer,":[80],"Polylogarithmic":[81],"inapproximability,":[82],"Proceedings":[84,177],"35th":[87],"Annual":[88,181],"ACM":[89],"Symposium":[90],"on":[91,139,183],"Theory":[92],"Computing,":[94],"2003,":[95],"pp.":[96,190],"585--594],":[97],"show":[99],"matching":[101],"lower":[102],"bound":[103],"$\\Omega(\\log^2{k}/\\log\\log{k})$":[105],"class":[108],"algorithms,":[112],"meaning":[113],"our":[115],"approximation":[116],"ratio":[117],"asymptotically":[119],"best":[121],"possible.":[122],"proceeded":[126],"by":[127,152],"reducing":[128],"intermediate":[132],"namely,":[134],"group":[136],"trees":[140],"with":[141],"dependency":[142],"constraint":[143],"which":[145],"approximate":[147],"using":[148],"framework":[150],"developed":[151],"[Rothvo\u00df,":[153],"Directed":[154],"Tree":[156],"Lasserre":[159],"Hierarchy,":[160],"preprint,":[161],"arxiv:1111.5473,":[162],"2011]":[163],"[Friggstad":[165],"et":[166],"al.,":[167],"Linear":[168],"programming":[169],"hierarchies":[170],"suffice":[171],"tree,":[175],"17th":[180],"Conference":[182],"Integer":[184],"Programming":[185],"Combinatorial":[187],"Optimization,":[188],"2014,":[189],"285--296].":[191]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}