{"id":"https://openalex.org/W2122632420","doi":"https://doi.org/10.1145/1011767.1011791","title":"Efficient algorithms for constructing (1+,\u03b5, \u03b2)-spanners in the distributed and streaming models","display_name":"Efficient algorithms for constructing (1+,\u03b5, \u03b2)-spanners in the distributed and streaming models","publication_year":2004,"publication_date":"2004-07-25","ids":{"openalex":"https://openalex.org/W2122632420","doi":"https://doi.org/10.1145/1011767.1011791","mag":"2122632420"},"language":"en","primary_location":{"id":"doi:10.1145/1011767.1011791","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1011767.1011791","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing","raw_type":"proceedings-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/A5075683085","display_name":"Michael Elkin","orcid":"https://orcid.org/0000-0003-4257-2122"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Elkin","raw_affiliation_strings":["Yale University, New Haven, CT","YALE UNIVERSITY, New Haven, CT"],"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"YALE UNIVERSITY, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100409987","display_name":"Jian Zhang","orcid":"https://orcid.org/0000-0002-6558-791X"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jian Zhang","raw_affiliation_strings":["Yale University, New Haven, CT","YALE UNIVERSITY, New Haven, CT"],"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"YALE UNIVERSITY, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075683085"],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":3.836,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.93550322,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"160","last_page":"168"},"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.9993000030517578,"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.9926000237464905,"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.9228798151016235},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.799391508102417},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6324961185455322},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5784960985183716},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5483471155166626},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5415246486663818},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5260072946548462},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5050635933876038},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.48365840315818787},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.45778098702430725},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4545955955982208},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4529619514942169},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4395439028739929},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42738646268844604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41080498695373535},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.15619197487831116},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.12940099835395813}],"concepts":[{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.9228798151016235},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.799391508102417},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6324961185455322},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5784960985183716},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5483471155166626},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5415246486663818},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5260072946548462},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5050635933876038},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.48365840315818787},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.45778098702430725},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4545955955982208},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4529619514942169},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4395439028739929},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42738646268844604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41080498695373535},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.15619197487831116},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.12940099835395813},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1011767.1011791","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1011767.1011791","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W189727877","https://openalex.org/W1568961751","https://openalex.org/W1574233320","https://openalex.org/W1761167196","https://openalex.org/W1965972569","https://openalex.org/W1970052762","https://openalex.org/W1980223785","https://openalex.org/W1983706581","https://openalex.org/W1988067232","https://openalex.org/W1993355353","https://openalex.org/W1995484833","https://openalex.org/W2001609476","https://openalex.org/W2002296715","https://openalex.org/W2005580106","https://openalex.org/W2006786627","https://openalex.org/W2012245520","https://openalex.org/W2018963243","https://openalex.org/W2041167985","https://openalex.org/W2042333226","https://openalex.org/W2042631176","https://openalex.org/W2044334960","https://openalex.org/W2057792779","https://openalex.org/W2058426370","https://openalex.org/W2075459377","https://openalex.org/W2080745194","https://openalex.org/W2081385108","https://openalex.org/W2082210092","https://openalex.org/W2083534148","https://openalex.org/W2091569826","https://openalex.org/W2091684877","https://openalex.org/W2100369465","https://openalex.org/W2122929038","https://openalex.org/W2147599477","https://openalex.org/W2149100736","https://openalex.org/W2151021662","https://openalex.org/W2156047991","https://openalex.org/W2163964823","https://openalex.org/W2165753192","https://openalex.org/W2618199688","https://openalex.org/W4205300528","https://openalex.org/W4229720786","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W2114946841","https://openalex.org/W2902692154","https://openalex.org/W2122632420","https://openalex.org/W4287999588","https://openalex.org/W2993304180","https://openalex.org/W3082881870","https://openalex.org/W2044334960","https://openalex.org/W2062550101","https://openalex.org/W1620133714","https://openalex.org/W2033607935"],"abstract_inverted_index":{"For":[0],"an":[1,28,65,114,231,250],"unweighted":[2],"undirected":[3],"graph":[4,75],"G=":[5],"(V,E),":[6],"and":[7,99,108,160,196,208,230],"a":[8,19,79,132,135,198,203,224],"pair":[9,35],"of":[10,30,36,103,118,158,178,206,214,219,234,267,292,299,314,333],"positive":[11],"integers":[12],"\u03b1":[13,44],"\u2265":[14,17],"1,":[15],"\u03b2":[16,67,235],"0,":[18,58],"subgraph":[20],"G'=":[21],"(V,H),":[22],"H":[23],"\u2286":[24],"E,":[25],"is":[26,113],"called":[27],"(\u03b1,\u03b2)-spanner":[29],"G":[31,76],"if":[32],"for":[33,54,72,89,145,185,216,249,261,288,326],"every":[34,73],"vertices":[37],"u,":[38],"v":[39],"\u2208":[40],"V,":[41],"distG'(u,v)":[42,46],"\u2264":[43],"\u2022":[45,210],"+":[47,228],"\u03b2.It":[48],"was":[49,92],"shown":[50],"in":[51,94,246,316],"[20]":[52],"that":[53,71,104,121,172,182,201,322],"any":[55,323],"e":[56],">":[57,254],"\u03ba":[59,269],"=":[60,68],"1,2,":[61],"...,":[62],"there":[63,77],"exists":[64,78],"integer":[66],"\u03b2(e,\u03ba)":[69],"such":[70],"n-vertex":[74],"(1+e,\u03b2)-spanner":[80],"G'":[81],"with":[82,134,164],"O(n1+1/\u03ba)":[83,286],"edges.":[84],"An":[85],"efficient":[86],"distributed":[87],"protocol":[88,105,120,133,149,157,177,184],"constructing":[90,146,186],"(1+e,\u03b2)-spanners":[91],"devised":[93],"[18].":[95],"The":[96,256],"running":[97,138],"time":[98,139,247,287],"the":[100,119,124,151,156,166,170,176,193,238,262,273,277,293,297,306,311],"communication":[101,153],"complexity":[102,154],"are":[106,173],"O(n1+\u03c1)":[107],"O(|E|n\u03c1),":[109],"respectively,":[110],"where":[111],"\u03c1":[112,253],"additional":[115],"control":[116],"parameter":[117],"affects":[122],"only":[123,257],"additive":[125,232],"term":[126,233],"\u03b2.In":[127],"this":[128],"paper":[129],"we":[130],"devise":[131,197],"drastically":[136],"improved":[137],"(O(n\u03c1)":[140],"as":[141,155,169,281,308],"opposed":[142,309],"to":[143,192,310],"(O(n1+\u03c1)":[144],"(1+e,\u03b2)-spanners.":[147],"Our":[148,241],"has":[150,276],"same":[152,167,278],"[18],":[159],"it":[161],"constructs":[162,265],"spanners":[163,171],"essentially":[165],"properties":[168],"constructed":[174],"by":[175,223],"[18].We":[179],"also":[180,320],"show":[181,321],"our":[183,282,317],"(1+e,":[187],"\u03b2)-spanners":[188],"can":[189],"be":[190],"adapted":[191],"streaming":[194,199,324],"model,":[195],"algorithm":[200,242,260,298,325],"uses":[202,301],"constant":[204,312],"number":[205,313],"passes":[207,315],"O(n1+1/\u03ba":[209],"log":[211],"n)":[212],"bits":[213,332],"space":[215,279],"computing":[217],"all-pairs-almost-shortest-paths":[218],"length":[220,268],"at":[221],"most":[222],"multiplicative":[225],"factor":[226],"(1":[227],"e)":[229],"greater":[236,271],"than":[237,272],"shortest":[239,274],"paths.":[240],"processes":[243],"each":[244,290],"edge":[245,291],"O(n\u03c1),":[248],"arbitrarily":[251],"small":[252],"0.":[255],"previously":[258],"known":[259],"problem":[263],"[21]":[264,300],"paths":[266],"times":[270],"paths,":[275],"requirements":[280],"algorithm,":[283],"but":[284],"requires":[285,330],"processing":[289],"input":[294],"graph.":[295],"However,":[296],"just":[302],"one":[303],"pass":[304],"over":[305],"input,":[307],"algorithm.":[318],"We":[319],"o(n)-approximate":[327],"distance":[328],"computation":[329],"\u03a9(n)":[331],"space.":[334]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}