{"id":"https://openalex.org/W2900806478","doi":"https://doi.org/10.1145/3274651","title":"Efficient Algorithms for Constructing Very Sparse Spanners and Emulators","display_name":"Efficient Algorithms for Constructing Very Sparse Spanners and Emulators","publication_year":2018,"publication_date":"2018-11-16","ids":{"openalex":"https://openalex.org/W2900806478","doi":"https://doi.org/10.1145/3274651","mag":"2900806478"},"language":"en","primary_location":{"id":"doi:10.1145/3274651","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3274651","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","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/A5075683085","display_name":"Michael Elkin","orcid":"https://orcid.org/0000-0003-4257-2122"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Michael Elkin","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beer-Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066182501","display_name":"Ofer Neiman","orcid":"https://orcid.org/0000-0003-4179-4364"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ofer Neiman","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beer-Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075683085"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":null,"apc_paid":null,"fwci":4.5134,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.95596847,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"15","issue":"1","first_page":"1","last_page":"29"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9970999956130981,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9966999888420105,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanner","display_name":"Spanner","score":0.888195812702179},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6227497458457947},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5997555255889893},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5543639659881592},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5323147177696228},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5162286758422852},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4662334620952606},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44214528799057007},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4388739764690399},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4341435730457306},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34113287925720215}],"concepts":[{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.888195812702179},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6227497458457947},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5997555255889893},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5543639659881592},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5323147177696228},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5162286758422852},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4662334620952606},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44214528799057007},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4388739764690399},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4341435730457306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34113287925720215},{"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/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3274651","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3274651","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":66,"referenced_works":["https://openalex.org/W1500591628","https://openalex.org/W1513982482","https://openalex.org/W1574233320","https://openalex.org/W1576928406","https://openalex.org/W1791758941","https://openalex.org/W1863701533","https://openalex.org/W1966206200","https://openalex.org/W1969080501","https://openalex.org/W1972920042","https://openalex.org/W1978086920","https://openalex.org/W1987669032","https://openalex.org/W1988067232","https://openalex.org/W1991838331","https://openalex.org/W1998544343","https://openalex.org/W2002041206","https://openalex.org/W2005580106","https://openalex.org/W2017427469","https://openalex.org/W2018963243","https://openalex.org/W2025919541","https://openalex.org/W2033607935","https://openalex.org/W2033698604","https://openalex.org/W2037793233","https://openalex.org/W2041571997","https://openalex.org/W2042333226","https://openalex.org/W2044112344","https://openalex.org/W2044334960","https://openalex.org/W2045446569","https://openalex.org/W2051137072","https://openalex.org/W2056518357","https://openalex.org/W2058374373","https://openalex.org/W2061507472","https://openalex.org/W2072142932","https://openalex.org/W2077059864","https://openalex.org/W2082352769","https://openalex.org/W2085630237","https://openalex.org/W2091569826","https://openalex.org/W2092349993","https://openalex.org/W2092534058","https://openalex.org/W2093429583","https://openalex.org/W2095941092","https://openalex.org/W2097747425","https://openalex.org/W2099237198","https://openalex.org/W2099556589","https://openalex.org/W2102560346","https://openalex.org/W2114493937","https://openalex.org/W2120666958","https://openalex.org/W2130674086","https://openalex.org/W2149100736","https://openalex.org/W2156047991","https://openalex.org/W2172178473","https://openalex.org/W2221370457","https://openalex.org/W2227069303","https://openalex.org/W2398255676","https://openalex.org/W2401485379","https://openalex.org/W2476017094","https://openalex.org/W2508242704","https://openalex.org/W2508647357","https://openalex.org/W2751315341","https://openalex.org/W2949556662","https://openalex.org/W2951161514","https://openalex.org/W2963530558","https://openalex.org/W2963618817","https://openalex.org/W2997658321","https://openalex.org/W3029326207","https://openalex.org/W4205300528","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W2993304180","https://openalex.org/W4287999588","https://openalex.org/W3082881870","https://openalex.org/W2602319784","https://openalex.org/W2037793233","https://openalex.org/W2033607935","https://openalex.org/W4377371889","https://openalex.org/W4237934402","https://openalex.org/W4389362338","https://openalex.org/W2113623403"],"abstract_inverted_index":{"Miller":[0],"et":[1],"al.":[2],"[48]":[3,59],"devised":[4],"a":[5,15,62,73,179,217,244],"distributed":[6,65,126],"1":[7],"algorithm":[8,66,98,127,149],"in":[9,42,67,101,128,132,154,157,267],"the":[10,55,68,124,129,133,158],"CONGEST":[11,130],"model":[12,70],"that,":[13],"given":[14,177],"parameter":[16],"k":[17,24,38,45,63,75,82,93,102,165],"=":[18],"1,2,\u2026,":[19],"constructs":[20,72,137],"an":[21,27],"O":[22,34,43,78,230],"(":[23,35,44,79,231],")-spanner":[25],"of":[26,48,57,108,238,247,252,259],"input":[28],"unweighted":[29,206,268],"n":[30,36,80,95,110,207,222,227,232],"-vertex":[31,208],"graph":[32,209],"with":[33,77,85,114,229],"1+1/":[37,81],")":[39,46,233],"expected":[40],"edges":[41,248],"rounds":[47],"communication.":[49],"In":[50,199],"this":[51,122],"article,":[52],"we":[53,201,255],"improve":[54],"result":[56],"Reference":[58],"by":[60,178],"showing":[61],"-round":[64],"same":[69],"that":[71,136,145,170,203],"(2":[74],"\u22121)-spanner":[76],"}/\u03f5)":[83],"edges,":[84],"probability":[86,115],"1\u2212\u03f5":[87],"for":[88,163,194,204,249],"any":[89,174,205,211],"\u03f5>0.":[90],"Moreover,":[91],"when":[92],"=\u03c9(log":[94],"),":[96],"our":[97,120,260],"produces":[99],"(still":[100],"rounds)":[103],"ultra-sparse":[104],"spanners,":[105],"i.e.,":[106],"spanners":[107,138,169],"size":[109],"(1+":[111,218],"o":[112,117],"(1)),":[113],"1\u2212":[116],"(1).":[118],"To":[119],"knowledge,":[121],"is":[123],"first":[125],"or":[131,139],"PRAM":[134],"models":[135],"skeletons":[140],"(i.e.,":[141],"connected":[142],"spanning":[143],"subgraphs)":[144],"are":[146,171],"sparse.":[147],"Our":[148],"can":[150],"also":[151,185],"be":[152],"implemented":[153],"linear":[155],"time":[156,182],"standard":[159],"centralized":[160],"model,":[161],"and":[162,197,210,241],"large":[164],",":[166],"it":[167],"provides":[168],"sparser":[172],"than":[173],"other":[175],"spanner":[176],"known":[180],"(near-)linear":[181],"algorithm.":[183],"We":[184],"devise":[186],"improved":[187],"bounds":[188],"(and":[189],"algorithms":[190],"realizing":[191],"these":[192],"bounds)":[193],"(1+\u03f5,":[195,239],"\u03b2)-spanners":[196,240],"emulators.":[198],"particular,":[200],"show":[202],"\u03f5":[212],">":[213],"0,":[214],"there":[215],"exists":[216],"\u03f5,":[219],"(log":[220],"log":[221,225,226],"/":[223],"\u03f5)":[224],")-emulator":[228],"edges.":[234],"All":[235],"previous":[236],"constructions":[237],"emulators":[242],"employ":[243],"superlinear":[245],"number":[246],"all":[250],"choices":[251],"parameters.":[253],"Finally,":[254],"provide":[256],"some":[257],"applications":[258],"results":[261],"to":[262],"approximate":[263],"shortest":[264],"paths\u2019":[265],"computation":[266],"graphs.":[269]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-25T08:39:21.599409","created_date":"2025-10-10T00:00:00"}