{"id":"https://openalex.org/W2902989566","doi":"https://doi.org/10.1137/16m1105815","title":"A Hierarchy of Lower Bounds for Sublinear Additive Spanners","display_name":"A Hierarchy of Lower Bounds for Sublinear Additive Spanners","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2902989566","doi":"https://doi.org/10.1137/16m1105815","mag":"2902989566"},"language":"en","primary_location":{"id":"doi:10.1137/16m1105815","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1105815","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051832024","display_name":"Amir Abboud","orcid":"https://orcid.org/0000-0002-0502-4517"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amir Abboud","raw_affiliation_strings":["Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036011801","display_name":"Greg Bodwin","orcid":"https://orcid.org/0000-0001-9896-8906"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Greg Bodwin","raw_affiliation_strings":["Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seth Pettie","raw_affiliation_strings":["University of Michigan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.3267,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.95392383,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"47","issue":"6","first_page":"2203","last_page":"2236"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/sublinear-function","display_name":"Sublinear function","score":0.8671708106994629},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7563568353652954},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7190486788749695},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6923562288284302},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.541498601436615},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5059444308280945},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45790600776672363},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.45223990082740784},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4349328279495239},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.43280795216560364},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.4128556251525879},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.41195040941238403},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.14614635705947876},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.10728737711906433}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.8671708106994629},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7563568353652954},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7190486788749695},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6923562288284302},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.541498601436615},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5059444308280945},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45790600776672363},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.45223990082740784},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4349328279495239},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.43280795216560364},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.4128556251525879},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.41195040941238403},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.14614635705947876},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.10728737711906433},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/16m1105815","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1105815","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2386909900","display_name":null,"funder_award_id":"CCF-1318294","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3063726797","display_name":null,"funder_award_id":"2012338","funder_id":"https://openalex.org/F4320308960","funder_display_name":"United States - Israel Binational Science Foundation"},{"id":"https://openalex.org/G3198296171","display_name":"AF:Small:Data Structures for Dynamic Networks","funder_award_id":"1217338","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4167357606","display_name":"AitF:Collaborative Research: Bridging the Gap between Theory and Practice for Matching and Edge Cover Problems","funder_award_id":"1637546","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6459514698","display_name":"BSF:2012338:Shortest Paths: Upper and lower bounds","funder_award_id":"1417238","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6809486582","display_name":null,"funder_award_id":"CCF-1637546","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7613647231","display_name":null,"funder_award_id":"CCF-1514339","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7715961861","display_name":null,"funder_award_id":"CCF-1417238","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7974033425","display_name":null,"funder_award_id":"CCF-1217338","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8021246916","display_name":"TWC: Small: Collaborative: Cost-Competitve Analysis - A New Tool for Designing Secure Systems","funder_award_id":"1318294","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8734516770","display_name":"AF: Medium: Collaborative Research: Hardness in Polynomial Time","funder_award_id":"1514339","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8864822960","display_name":"AF:  Medium: Collaborative Research: Hardness in Polynomial Time","funder_award_id":"1514383","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8959633998","display_name":null,"funder_award_id":"CCF-1514383","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/F4320308960","display_name":"United States - Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W181128013","https://openalex.org/W1987996179","https://openalex.org/W1988067232","https://openalex.org/W1991809067","https://openalex.org/W2002041206","https://openalex.org/W2009852526","https://openalex.org/W2014317399","https://openalex.org/W2021022635","https://openalex.org/W2023600080","https://openalex.org/W2027697499","https://openalex.org/W2031536548","https://openalex.org/W2036752160","https://openalex.org/W2042333226","https://openalex.org/W2045446569","https://openalex.org/W2056148792","https://openalex.org/W2056496054","https://openalex.org/W2061342454","https://openalex.org/W2069001533","https://openalex.org/W2075862701","https://openalex.org/W2081163699","https://openalex.org/W2082352769","https://openalex.org/W2082538734","https://openalex.org/W2085630237","https://openalex.org/W2087806988","https://openalex.org/W2099237198","https://openalex.org/W2156047991","https://openalex.org/W2158860088","https://openalex.org/W2178691795","https://openalex.org/W2196216888","https://openalex.org/W2211624051","https://openalex.org/W2750647157","https://openalex.org/W4231761369","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W90906771","https://openalex.org/W2018828772","https://openalex.org/W2529185025","https://openalex.org/W2809723425","https://openalex.org/W2117548279","https://openalex.org/W2052708136","https://openalex.org/W2005302727","https://openalex.org/W3082028334","https://openalex.org/W4302306341","https://openalex.org/W2184770394"],"abstract_inverted_index":{"Spanners,":[0],"emulators,":[1],"and":[2,35,87,92,142,203,216,227,229,238,277,281,284,317,347,351,396],"approximate":[3],"distance":[4],"oracles":[5],"can":[6,298],"be":[7,299,427],"viewed":[8],"as":[9],"lossy":[10],"compression":[11,42,111,179,401],"schemes":[12,70,402],"that":[13,64,95,136,155,214,230,359,377,403,416],"represent":[14],"an":[15,27,220],"unweighted":[16],"graph":[17,110,400,406],"metric":[18],"in":[19,149,312,429],"small":[20],"space,":[21],"say":[22],"$\\tilde{O}(n^{1+\\delta})$":[23],"bits.":[24],"There":[25],"is":[26,77,144,415],"inherent":[28],"tradeoff":[29,50,223],"between":[30,224],"the":[31,36,41,45,137,146,157,161,231,273,293,313,341,361,387,430],"sparsity":[32,167],"parameter":[33,168],"$\\delta$":[34],"stretch":[37,74,163,190,296],"function":[38,164,191,297],"$f$":[39,165],"of":[40,48,90,140,152,160,207,235,257,275,310,315,343,371,382],"scheme,":[43],"but":[44,122],"qualitative":[46],"nature":[47],"this":[49,132],"has":[51,58,186],"remained":[52],"a":[53,150,187,254,379],"persistent":[54],"open":[55],"problem.":[56],"It":[57,211],"been":[59],"known":[60],"for":[61,166,173,331,357,399,405],"some":[62],"time":[63],"when":[65,96],"$\\delta\\ge":[66],"1/3$":[67,99],"there":[68,100],"are":[69,101,241,325],"with":[71,112,260,408,423],"constant":[72],"additive":[73,120,189,209,233,421],"(distance":[75],"$d$":[76],"stretched":[78],"to":[79,106,129,288,327,385,389],"at":[80,410],"most":[81],"$f(d)":[82,193],"=":[83,194],"d":[84,195],"+":[85,196],"O(1)$),":[86],"recent":[88],"results":[89],"Abboud":[91,141,316],"Bodwin":[93,143],"show":[94,135,393],"$\\delta":[97,113,169],"<":[98,266],"no":[102],"such":[103],"schemes.":[104],"Thus,":[105],"get":[107,337],"practically":[108],"efficient":[109],"\\to":[114],"0$":[115],"we":[116,127,134,252,324,392],"must":[117],"pay":[118],"superconstant":[119],"stretch,":[121],"exactly":[123],"how":[124],"much":[125],"do":[126],"have":[128,219],"pay?":[130],"In":[131],"paper":[133],"lower":[138,153,199,250,290,303,329,338,352,365,397],"bound":[139,200,270,304,366],"just":[145],"first":[147],"step":[148],"hierarchy":[151],"bounds":[154,251,291,330,339,353,398],"characterize":[156],"asymptotic":[158],"behavior":[159],"optimal":[162,222],"\\in":[170],"(0,1/3)$.":[171],"Specifically,":[172],"any":[174,178],"integer":[175],"$k\\ge":[176],"2$,":[177],"scheme":[180],"using":[181],"$O(n^{1+\\frac{1}{2^k-1}":[182],"-":[183],"\\epsilon})$":[184],"bits":[185],"sublinear":[188,208,232],"$f$:":[192],"\\Omega(d^{1-\\frac{1}{k}})$.":[197],"This":[198,268],"matches":[201],"Thorup":[202,280],"Zwick's":[204],"(2006)":[205],"construction":[206,256,349],"emulators.":[210],"also":[212],"shows":[213],"Elkin":[215,276,346],"Peleg's":[217],"$(1+\\epsilon,\\beta)$-spanners":[218],"essentially":[221],"$\\delta$,":[225],"$\\epsilon$,":[226],"$\\beta$,":[228],"spanners":[234,274],"Pettie":[236,285],"(2009)":[237],"Chechik":[239],"(2013)":[240],"not":[242],"too":[243],"far":[244],"from":[245],"optimal.":[246],"To":[247],"complement":[248],"these":[249,322],"present":[253],"new":[255],"$(1+\\epsilon,":[258],"O(k/\\epsilon)^{k-1})$-spanners":[259],"size":[261,269,294,342,424],"$O((k/\\epsilon)^{h_k}":[262],"kn^{1+\\frac{1}{2^{k+1}-1}})$,":[263],"where":[264],"$h_k":[265],"3/4$.":[267],"improves":[271],"on":[272,340,354],"Peleg":[278],"(2004),":[279],"Zwick":[282],"(2006),":[283],"(2009).":[286],"According":[287],"our":[289],"neither":[292],"nor":[295],"substantially":[300],"improved.":[301],"Our":[302,364],"technique":[305],"exhibits":[306],"several":[307,332],"interesting":[308],"degrees":[309],"freedom":[311],"framework":[314],"Bodwin.":[318],"By":[319],"carefully":[320],"exploiting":[321],"freedoms,":[323],"able":[326],"obtain":[328],"related":[333],"combinatorial":[334],"objects.":[335],"We":[336],"$(\\beta,\\epsilon)$-hopsets,":[344],"matching":[345,394],"Neiman's":[348],"(2016),":[350],"shortcutting":[355],"sets":[356],"digraphs":[358],"preserve":[360],"transitive":[362],"closure.":[363],"simplifies":[367],"Hesse's":[368],"(2003)":[369],"refutation":[370],"Thorup's":[372],"conjecture":[373],"(1992),":[374],"which":[375],"stated":[376],"adding":[378],"linear":[380],"number":[381],"shortcuts":[383],"suffices":[384],"reduce":[386],"diameter":[388],"polylogarithmic.":[390],"Finally,":[391],"upper":[395],"work":[404],"metrics":[407],"girth":[409],"least":[411],"$2\\gamma+1$.":[412],"One":[413],"consequence":[414],"Baswana":[417],"et":[418],"al.'s":[419],"(2010)":[420],"$O(\\gamma)$-spanners":[422],"$O(n^{1+\\frac{1}{2\\gamma+1}})$":[425],"cannot":[426],"improved":[428],"exponent.":[431]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}