{"id":"https://openalex.org/W4383604707","doi":"https://doi.org/10.1007/s00453-026-01384-6","title":"Approximation Algorithms for Directed Weighted Spanners","display_name":"Approximation Algorithms for Directed Weighted Spanners","publication_year":2026,"publication_date":"2026-04-13","ids":{"openalex":"https://openalex.org/W4383604707","doi":"https://doi.org/10.1007/s00453-026-01384-6"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-026-01384-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-026-01384-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-026-01384-6.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-026-01384-6.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090091569","display_name":"Elena Grigorescu","orcid":"https://orcid.org/0000-0001-9673-4313"},"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":"Elena Grigorescu","raw_affiliation_strings":["Computer Science, University of Waterloo, Ontario, Canada"],"raw_orcid":"https://orcid.org/0000-0001-9673-4313","affiliations":[{"raw_affiliation_string":"Computer Science, University of Waterloo, Ontario, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042751358","display_name":"Nithish Kumar","orcid":null},"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":false,"raw_author_name":"Nithish Kumar","raw_affiliation_strings":["Computer Science, University of Waterloo, Ontario, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science, University of Waterloo, Ontario, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019656174","display_name":"Young\u2010San Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I2802584246","display_name":"Melbourne School of Theology","ror":"https://ror.org/05kdkdw55","country_code":"AU","type":"education","lineage":["https://openalex.org/I2802584246"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Young-San Lin","raw_affiliation_strings":["Melbourne Business School, Victoria, Australia"],"raw_orcid":"https://orcid.org/0000-0002-5719-6708","affiliations":[{"raw_affiliation_string":"Melbourne Business School, Victoria, Australia","institution_ids":["https://openalex.org/I2802584246"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090091569"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00395402,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"88","issue":"3","first_page":null,"last_page":null},"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.9947999715805054,"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.9947999715805054,"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/T12288","display_name":"Optimization and Search Problems","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/combinatorics","display_name":"Combinatorics","score":0.7879727482795715},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6104811429977417},{"id":"https://openalex.org/keywords/spanner","display_name":"Spanner","score":0.5942718982696533},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5005347728729248},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.48699575662612915},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4742927849292755},{"id":"https://openalex.org/keywords/unit","display_name":"Unit (ring theory)","score":0.4513890743255615},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4209596514701843},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3790297508239746},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34363919496536255},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.16584402322769165},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11548098921775818},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06880763173103333}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7879727482795715},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6104811429977417},{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.5942718982696533},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5005347728729248},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.48699575662612915},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4742927849292755},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.4513890743255615},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4209596514701843},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3790297508239746},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34363919496536255},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.16584402322769165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11548098921775818},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06880763173103333},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.0},{"id":"https://openalex.org/C145420912","wikidata":"https://www.wikidata.org/wiki/Q853077","display_name":"Mathematics education","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s00453-026-01384-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-026-01384-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-026-01384-6.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2307.02774","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2307.02774","pdf_url":"https://arxiv.org/pdf/2307.02774","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:18833","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.8","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol275-approx-random2023/LIPIcs.APPROX-RANDOM.2023.8/LIPIcs.APPROX-RANDOM.2023.8.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.48550/arxiv.2307.02774","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2307.02774","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"doi:10.4230/lipics.approx/random.2023.8","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.approx/random.2023.8","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"doi:10.1007/s00453-026-01384-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-026-01384-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-026-01384-6.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6000000238418579,"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15"}],"awards":[{"id":"https://openalex.org/G1851394695","display_name":null,"funder_award_id":"CCF-1910659","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3413386665","display_name":"CIF: Small: Ultra-Efficient Codes for Communication and Verifiable Storage","funder_award_id":"1910659","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5248534551","display_name":"AF: Small: New Efficient Algorithms for Complex Data","funder_award_id":"1910411","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5287145524","display_name":null,"funder_award_id":"CCF-1910411","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G606936851","display_name":"Fast and Robust Algorithms with Partial Data Access","funder_award_id":"2228814","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309036","display_name":"Purdue University","ror":"https://ror.org/02dqehb95"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4383604707.pdf","grobid_xml":"https://content.openalex.org/works/W4383604707.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2949889395","https://openalex.org/W4297623464","https://openalex.org/W2162831161","https://openalex.org/W2126497992","https://openalex.org/W2082551413","https://openalex.org/W3197005352","https://openalex.org/W4240054244","https://openalex.org/W2242006561","https://openalex.org/W2962992394","https://openalex.org/W2356121840"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"the":[2,42,119,124,169,176,224,228,244],"pairwise":[3],"weighted":[4,120],"spanner":[5,121],"problem,":[6],"we":[7,136],"are":[8,46,282],"given":[9],"a":[10,26,29,37,89,234,318],"directed":[11],"graph":[12],"with":[13,130],"n":[14,134],"vertices":[15],"and":[16,28,95,115,174,215,236,313,317],"k":[17],"terminal":[18,43],"vertex":[19,229],"pairs.":[20],"Each":[21],"edge":[22],"is":[23,34],"assigned":[24],"both":[25],"cost":[27],"length":[30],".":[31],"The":[32,279],"goal":[33],"to":[35,57,86,211,242],"find":[36],"minimum-cost":[38],"subgraph":[39],"in":[40,133],"which":[41],"distance":[44,113,245],"constraints":[45],"satisfied.":[47],"A":[48],"more":[49],"restricted":[50],"variant":[51],"of":[52,98],"this":[53],"problem":[54,122],"was":[55],"shown":[56],"be":[58,239],"$$O(2^{{\\log":[59],"^{1-\\varepsilon":[60],"}":[61],"n}})$$":[62],"<mml:math":[63,143,186,254,285,328],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[64,144,187,255,286,329],"<mml:mrow>":[65,70,73,145,150,154,188,193,197,256,261,265,287,292,296,330,337,341,356],"<mml:mi>O</mml:mi>":[66,147,190,258,289,334,353],"<mml:mo>(</mml:mo>":[67,151,194,262,293,338,357],"<mml:msup>":[68,71,152,195,263,294,339,358],"<mml:mn>2</mml:mn>":[69,268,344],"<mml:mo>log</mml:mo>":[72],"<mml:mn>1</mml:mn>":[74,266,342],"<mml:mo>-</mml:mo>":[75],"<mml:mi>\u03b5</mml:mi>":[76,159,202,270,346],"</mml:mrow>":[77,80,83,160,163,164,203,206,207,271,274,275,300,303,304,347,350],"</mml:msup>":[78,81,161,204,272,301,348],"<mml:mi>n</mml:mi>":[79,153,196,295],"<mml:mo>)</mml:mo>":[82,162,205,273,302,349],"</mml:math>":[84,165,208,276,305],"-hard":[85],"approximate":[87],"under":[88],"standard":[90],"complexity":[91],"assumption,":[92],"by":[93],"Elkin":[94],"Peleg":[96],"(Theory":[97],"Computing":[99],"Systems,":[100],"2007).":[101],"This":[102],"general":[103],"formulation":[104],"captures":[105],"many":[106],"well-studied":[107],"network":[108],"connectivity":[109],"problems,":[110],"including":[111],"spanners,":[112],"preservers,":[114],"Steiner":[116],"forests.":[117],"For":[118],"where":[123,227],"edges":[125,170,237,309],"have":[126,171,310],"positive":[127,315],"integral":[128],"lengths":[129],"magnitudes":[131],"polynomial":[132],",":[135],"show":[137,248],"an":[138,181,249,283],"$$\\tilde{O}(n^{4/5":[139],"+":[140,183,251,321,325],"\\varepsilon":[141,184,252,322,326],"})$$":[142,185,253],"<mml:mover>":[146,189,257,288,333,352],"<mml:mo>~</mml:mo>":[148,191,259,290,335,354],"</mml:mover>":[149,192,260,291,336,355],"<mml:mn>4</mml:mn>":[155,297],"<mml:mo>/</mml:mo>":[156,199,267,298,343],"<mml:mn>5</mml:mn>":[157,200,299],"<mml:mo>+</mml:mo>":[158,201,269,345],"-approximation":[166],"algorithm.":[167,278],"When":[168],"unit":[172,311],"costs":[173,312],"lengths,":[175,316],"best":[177],"previous":[178],"algorithm":[179,307],"gives":[180],"$$\\tilde{O}(n^{3/5":[182],"<mml:mn>3</mml:mn>":[198],"-approximation,":[209],"due":[210],"Chlamt\u00e1\u010d,":[212],"Dinitz,":[213],"Kortsarz,":[214],"Laekhanukit":[216],"(Transactions":[217],"on":[218],"Algorithms,":[219],"2020).":[220],"We":[221,247],"also":[222],"consider":[223],"online":[225],"setting,":[226],"pairs":[230],"arrive":[231],"one":[232],"at":[233],"time,":[235],"must":[238],"added":[240],"irrevocably":[241],"satisfy":[243],"constraints.":[246],"$$\\tilde{O}(k^{1/2":[250],"<mml:mi>k</mml:mi>":[264,340],"-competitive":[277,306],"state-of-the-art":[280],"results":[281],"$$\\tilde{O}(n^{4/5})$$":[284],"when":[308],"arbitrary":[314],"$$\\min":[319],"\\{\\tilde{O}(k^{1/2":[320],"}),":[323],"\\tilde{O}(n^{2/3":[324],"})\\}$$":[327],"<mml:mo>min</mml:mo>":[331],"<mml:mo>{</mml:mo>":[332],"<mml:mo>,</mml:mo>":[351]},"counts_by_year":[],"updated_date":"2026-04-15T05:59:14.812645","created_date":"2023-07-08T00:00:00"}