{"id":"https://openalex.org/W2951926403","doi":"https://doi.org/10.1145/3323165.3323177","title":"Linear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets in RNC","display_name":"Linear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets in RNC","publication_year":2019,"publication_date":"2019-06-17","ids":{"openalex":"https://openalex.org/W2951926403","doi":"https://doi.org/10.1145/3323165.3323177","mag":"2951926403"},"language":"en","primary_location":{"id":"doi:10.1145/3323165.3323177","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3323165.3323177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"conference-paper","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":false,"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":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":null,"apc_paid":null,"fwci":7.8228,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.98427729,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"333","last_page":"341"},"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.9990000128746033,"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.9990000128746033,"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.9894999861717224,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9746999740600586,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/bounded-function","display_name":"Bounded function","score":0.6262389421463013},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6009654998779297},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5989734530448914},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5834110379219055},{"id":"https://openalex.org/keywords/aka","display_name":"AKA","score":0.5653282403945923},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5420508980751038},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4837667942047119},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45779305696487427},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4188340902328491},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4173380434513092},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3559029996395111}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6262389421463013},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6009654998779297},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5989734530448914},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5834110379219055},{"id":"https://openalex.org/C121158502","wikidata":"https://www.wikidata.org/wiki/Q4652161","display_name":"AKA","level":2,"score":0.5653282403945923},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5420508980751038},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4837667942047119},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45779305696487427},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4188340902328491},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4173380434513092},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3559029996395111},{"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/C161191863","wikidata":"https://www.wikidata.org/wiki/Q199655","display_name":"Library science","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3323165.3323177","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3323165.3323177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2083611340","display_name":null,"funder_award_id":"2015813","funder_id":"https://openalex.org/F4320320950","funder_display_name":"United States-Israel Binational Science Foundation"},{"id":"https://openalex.org/G6387705637","display_name":null,"funder_award_id":"724/15 and 1817/17","funder_id":"https://openalex.org/F4320322248","funder_display_name":"Israel Academy of Sciences and Humanities"}],"funders":[{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320322248","display_name":"Israel Academy of Sciences and Humanities","ror":"https://ror.org/03c6c9520"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W189727877","https://openalex.org/W816673839","https://openalex.org/W1602103078","https://openalex.org/W1836810876","https://openalex.org/W2002296715","https://openalex.org/W2014317399","https://openalex.org/W2033698604","https://openalex.org/W2040011014","https://openalex.org/W2040273581","https://openalex.org/W2042333226","https://openalex.org/W2044112344","https://openalex.org/W2049628259","https://openalex.org/W2049774319","https://openalex.org/W2056148792","https://openalex.org/W2056496054","https://openalex.org/W2056518357","https://openalex.org/W2075862701","https://openalex.org/W2085630237","https://openalex.org/W2087489294","https://openalex.org/W2093455937","https://openalex.org/W2099556589","https://openalex.org/W2120994821","https://openalex.org/W2149100736","https://openalex.org/W2208938718","https://openalex.org/W2476434590","https://openalex.org/W2508647357","https://openalex.org/W2568484534","https://openalex.org/W2592613193","https://openalex.org/W2610522381","https://openalex.org/W2611434696","https://openalex.org/W2793130010","https://openalex.org/W2810930637","https://openalex.org/W2949524113","https://openalex.org/W2952490263","https://openalex.org/W2963618817","https://openalex.org/W3100139999"],"related_works":["https://openalex.org/W2052136967","https://openalex.org/W1719252778","https://openalex.org/W922283457","https://openalex.org/W2008276241","https://openalex.org/W2169820283","https://openalex.org/W2031098440","https://openalex.org/W2555545330","https://openalex.org/W2034217845","https://openalex.org/W4306705875","https://openalex.org/W2374778222"],"abstract_inverted_index":{"For":[0,39],"a":[1,9,15,47,54,80,95,115,123,175,187,198,242],"positive":[2],"parameter":[3],"\u03b2,":[4],"the":[5,23,26,59,131,144,209,230,238],"\u03b2-bounded":[6,72],"distance":[7],"between":[8],"pair":[10],"of":[11,25,49,97,103,125,157,179,234,269],"vertices":[12],"u,v":[13],"in":[14,30,67,74,94,160,237,263],"weighted":[16,244],"undirected":[17],"graph":[18,55,245],"G":[19,31,50,68,75],"=":[20,51],"(V,E,\u00f8mega)":[21,52],"is":[22,53,205],"length":[24],"shortest":[27,235,259],"u-v":[28],"path":[29],"with":[32,108,114,128,174,190,197],"at":[33],"most":[34],"\u03b2":[35,40],"edges,":[36,112],"aka":[37],"hops.":[38],"as":[41],"above":[42],"and":[43,83,86,162,249],"\u03b5":[44],">":[45],"0,":[46],"(\u03b2,\u03b5)-hopset":[48],"GH":[56],"=(V,H,\u00f8megaH)":[57],"on":[58,133],"same":[60],"vertex":[61,254],"set,":[62],"such":[63],"that":[64],"all":[65,257],"distances":[66,73],"are":[69,79,88,215],"(1+\u03b5)-approximated":[70],"by":[71],"\u222a":[76],"GH.":[77],"Hopsets":[78],"fundamental":[81],"graph-theoretic":[82],"graph-algorithmic":[84],"construct,":[85],"they":[87],"widely":[89],"used":[90],"for":[91,147,171,194],"distance-related":[92],"problems":[93],"variety":[96],"computational":[98],"settings.":[99,164],"Currently":[100],"existing":[101,167],"constructions":[102,268],"hopsets":[104,106,127,149,173,196,214,227,270],"produce":[105],"either":[107,272],"\u00d8mega(n":[109],"\u0142og":[110,136,138],"n)":[111,180],"or":[113,277],"hopbound":[116,129,146,181],"n\u00d8mega(1).":[117],"In":[118],"this":[119],"paper":[120],"we":[121],"devise":[122,154,186],"construction":[124,159],"linear-size":[126,148],"(ignoring":[130],"dependence":[132],"\u03b5)":[134],"(\u0142og":[135],"n)\u0142og":[137],"n":[139],"+":[140],"O(1).":[141],"This":[142],"improves":[143],"previous":[145,210,267],"almost":[150],"exponentially.":[151],"We":[152,185,224],"also":[153,216],"efficient":[155],"implementations":[156],"our":[158,202],"PRAM":[161,168,188,239],"distributed":[163],"The":[165],"only":[166],"algorithm":[169,189],"[11]":[170],"computing":[172,195],"constant":[176,199,264],"(i.e.,":[177],"independent":[178],"requires":[182],"n\u00d8mega(1)":[183],"time.":[184,265,280],"polylogarithmic":[191,247,273],"running":[192,203],"time":[193,204,274],"hopbound,":[200],"i.e.,":[201],"exponentially":[206],"better":[207],"than":[208,219],"one.":[211],"Moreover,":[212],"these":[213,226],"significantly":[217],"sparser":[218],"their":[220],"counterparts":[221],"from":[222,261],"[11].":[223],"apply":[225],"to":[228],"achieve":[229],"following":[231],"online":[232],"variant":[233],"paths":[236,260],"model:":[240],"preprocess":[241],"given":[243,251],"within":[246],"time,":[248],"then":[250],"any":[252],"query":[253,276],"v,":[255],"report":[256],"approximate":[258],"v":[262],"All":[266],"require":[271],"per":[275],"polynomial":[278],"preprocessing":[279]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}