{"id":"https://openalex.org/W2750647157","doi":"https://doi.org/10.1145/3088511","title":"The 4/3 Additive Spanner Exponent Is Tight","display_name":"The 4/3 Additive Spanner Exponent Is Tight","publication_year":2017,"publication_date":"2017-08-31","ids":{"openalex":"https://openalex.org/W2750647157","doi":"https://doi.org/10.1145/3088511","mag":"2750647157"},"language":"en","primary_location":{"id":"doi:10.1145/3088511","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3088511","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","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":true,"raw_author_name":"Amir Abboud","raw_affiliation_strings":["Stanford University, Stanford, CA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","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, Stanford, CA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051832024"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":5.4508,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.96518066,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"64","issue":"4","first_page":"1","last_page":"20"},"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.9976000189781189,"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.9918000102043152,"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/spanner","display_name":"Spanner","score":0.9789056777954102},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.7704324126243591},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7570761442184448},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7482638955116272},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6092514991760254},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5475389361381531},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5180859565734863},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5128305554389954},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.5018839836120605},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4711279571056366},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2239682376384735},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.13002333045005798}],"concepts":[{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.9789056777954102},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7704324126243591},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7570761442184448},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7482638955116272},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6092514991760254},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5475389361381531},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5180859565734863},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5128305554389954},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.5018839836120605},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4711279571056366},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2239682376384735},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.13002333045005798},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3088511","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3088511","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G152872077","display_name":null,"funder_award_id":"CCF-1417238, CCF-1528078 and CCF-1514339","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"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W345196136","https://openalex.org/W1504267162","https://openalex.org/W1564010364","https://openalex.org/W1582742149","https://openalex.org/W1607700260","https://openalex.org/W1738494763","https://openalex.org/W1937137463","https://openalex.org/W1971052845","https://openalex.org/W1972920042","https://openalex.org/W1980466385","https://openalex.org/W1987669032","https://openalex.org/W1988067232","https://openalex.org/W1994467027","https://openalex.org/W2002041206","https://openalex.org/W2002300095","https://openalex.org/W2011473626","https://openalex.org/W2018963243","https://openalex.org/W2021932455","https://openalex.org/W2023600080","https://openalex.org/W2027697499","https://openalex.org/W2028293948","https://openalex.org/W2031536548","https://openalex.org/W2033698604","https://openalex.org/W2042333226","https://openalex.org/W2045446569","https://openalex.org/W2061507472","https://openalex.org/W2063491776","https://openalex.org/W2092534058","https://openalex.org/W2093429583","https://openalex.org/W2093517369","https://openalex.org/W2099237198","https://openalex.org/W2113020082","https://openalex.org/W2135166946","https://openalex.org/W2141663929","https://openalex.org/W2172159738","https://openalex.org/W2221370457","https://openalex.org/W2268724598","https://openalex.org/W2275032947","https://openalex.org/W2508647357","https://openalex.org/W2809995963","https://openalex.org/W2951859740","https://openalex.org/W2963664420","https://openalex.org/W2997658321","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W2949889395","https://openalex.org/W2162831161","https://openalex.org/W4297623464","https://openalex.org/W2082551413","https://openalex.org/W2126497992","https://openalex.org/W3197005352","https://openalex.org/W2079518702","https://openalex.org/W1537274075","https://openalex.org/W2010173517","https://openalex.org/W4319874546"],"abstract_inverted_index":{"A":[0,47],"spanner":[1,31,94,270],"is":[2,17,22,43,54,73,83,199,223,292,329,335],"a":[3,23,30,61,84,93,119,133,200,210,216,250,258,336,359],"sparse":[4],"subgraph":[5],"that":[6,20,76,89,102,226],"approximately":[7],"preserves":[8,103],"the":[9,13,27,33,52,66,130,173,182,184,205,263,268,282,307,323,326,345],"pairwise":[10,105],"distances":[11,106],"of":[12,29,35,68,132,204,253,265,289,339],"original":[14],"graph.":[15],"It":[16],"well":[18],"known":[19],"there":[21,82],"smooth":[24],"tradeoff":[25,62,134],"between":[26],"sparsity":[28,264],"and":[32,157,177,357],"quality":[34],"its":[36,104],"approximation,":[37],"so":[38,238],"long":[39],"as":[40,303],"distance":[41,239],"error":[42,291,327],"measured":[44],"multiplicatively":[45],".":[46,348,377],"central":[48],"open":[49,188,206],"question":[50,185],"in":[51,65,209,281,322],"field":[53],"to":[55,108,122,332],"prove":[56],"or":[57],"disprove":[58],"whether":[59],"such":[60,88],"exists":[63],"also":[64,318],"regime":[67],"additive":[69,266,290],"error.":[70,248],"That":[71],"is,":[72],"it":[74,350],"true":[75],"for":[77,189,300,305],"all":[78,190],"\u03b5":[79,87,111,193,235],">":[80],"0,":[81],"constant":[85],"k":[86,110],"every":[90],"graph":[91,340,361],"has":[92,169,186],"on":[95,141,150,160,262,271,311],"O":[96,142,161,230,272,312],"(":[97,143,152,162,231,273,313],"n":[98,144,153,163,174,232,246,274,314],"1+\u03b5":[99],")":[100,146,155,165,236,276,316],"edges":[101,277,317],"up":[107],"+":[109,245],"?":[112],"Previous":[113],"lower":[114,260,298],"bounds":[115,128,299],"are":[116],"consistent":[117],"with":[118],"positive":[120],"resolution":[121,203],"this":[123],"question,":[124,207],"while":[125],"previous":[126],"upper":[127],"exhibit":[129],"beginning":[131],"curve:":[135],"All":[136],"graphs":[137,228,353],"have":[138],"+2":[139],"spanners":[140,149,159],"3/2":[145],"edges,":[147,156],"+4":[148,309],"\u00d5":[151],"7/5":[154],"+6":[158,269],"4/3":[164,175,233,275,315],"edges.":[166],"However,":[167],"progress":[168],"mysteriously":[170],"halted":[171],"at":[172],"bound,":[176],"despite":[178],"significant":[179],"effort":[180],"from":[181],"community,":[183],"remained":[187],"0":[191],"<":[192,194],"1/3.":[195],"Our":[196,294],"main":[197],"result":[198],"surprising":[201],"negative":[202],"even":[208,284],"highly":[211],"generalized":[212],"setting.":[213],"We":[214],"show":[215],"new":[217,297,337,360],"information":[218,240],"theoretic":[219],"incompressibility":[220],"bound:":[221],"There":[222],"no":[224],"function":[225],"compresses":[227],"into":[229],"\u2212":[234],"bits":[237],"can":[241],"be":[242,279,320],"recovered":[243],"within":[244],"o(1)":[247],"As":[249],"special":[251],"case":[252],"our":[254,333],"theorem,":[255],"we":[256,343],"get":[257],"tight":[259],"bound":[261],"spanners:":[267],"cannot":[278,319],"improved":[280,321],"exponent,":[283],"if":[285],"any":[286],"subpolynomial":[287],"amount":[288],"allowed.":[293],"theorem":[295],"implies":[296],"related":[301],"objects":[302],"well;":[304],"example,":[306],"20-year-old":[308],"emulator":[310],"exponent":[324],"unless":[325],"allowance":[328],"polynomial.":[330],"Central":[331],"construction":[334],"type":[338],"product,":[341],"which":[342],"call":[344],"Obstacle":[346],"Product":[347],"Intuitively,":[349],"takes":[351],"two":[352],"G":[354,362,376],",":[355],"H":[356,364,372],"produces":[358],"\u2297":[363],"whose":[365],"shortest":[366],"paths":[367],"structure":[368],"looks":[369],"locally":[370],"like":[371,375],"but":[373],"globally":[374]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}