{"id":"https://openalex.org/W2903064923","doi":"https://doi.org/10.1109/hpec.2018.8547539","title":"Accelerating Dijkstra's Algorithm Using Multiresolution Priority Queues","display_name":"Accelerating Dijkstra's Algorithm Using Multiresolution Priority Queues","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2903064923","doi":"https://doi.org/10.1109/hpec.2018.8547539","mag":"2903064923"},"language":"en","primary_location":{"id":"doi:10.1109/hpec.2018.8547539","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2018.8547539","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE High Performance extreme Computing Conference (HPEC)","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/A5011003534","display_name":"Jordi Ros-Giralt","orcid":"https://orcid.org/0000-0003-4450-609X"},"institutions":[{"id":"https://openalex.org/I4210102519","display_name":"Reservoir Labs (United States)","ror":"https://ror.org/01a3m3f05","country_code":"US","type":"company","lineage":["https://openalex.org/I4210102519"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jordi Ros-Giralt","raw_affiliation_strings":["Reservoir Labs, New York, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Reservoir Labs, New York, NY","institution_ids":["https://openalex.org/I4210102519"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043855257","display_name":"Alan Commike","orcid":null},"institutions":[{"id":"https://openalex.org/I4210102519","display_name":"Reservoir Labs (United States)","ror":"https://ror.org/01a3m3f05","country_code":"US","type":"company","lineage":["https://openalex.org/I4210102519"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan Commike","raw_affiliation_strings":["Reservoir Labs, New York, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Reservoir Labs, New York, NY","institution_ids":["https://openalex.org/I4210102519"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047766964","display_name":"Peter Cullen","orcid":null},"institutions":[{"id":"https://openalex.org/I4210102519","display_name":"Reservoir Labs (United States)","ror":"https://ror.org/01a3m3f05","country_code":"US","type":"company","lineage":["https://openalex.org/I4210102519"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter Cullen","raw_affiliation_strings":["Reservoir Labs, New York, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Reservoir Labs, New York, NY","institution_ids":["https://openalex.org/I4210102519"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108503417","display_name":"Richard Lethin","orcid":null},"institutions":[{"id":"https://openalex.org/I4210102519","display_name":"Reservoir Labs (United States)","ror":"https://ror.org/01a3m3f05","country_code":"US","type":"company","lineage":["https://openalex.org/I4210102519"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard Lethin","raw_affiliation_strings":["Reservoir Labs, New York, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Reservoir Labs, New York, NY","institution_ids":["https://openalex.org/I4210102519"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210102519"],"apc_list":null,"apc_paid":null,"fwci":0.1804,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.40554059,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973999857902527,"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/T10142","display_name":"Formal Methods in Verification","score":0.9947999715805054,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7647267580032349},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6086301803588867},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5778964757919312},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.5407623648643494},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5348765850067139},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.4609189033508301},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44835221767425537},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4161509573459625},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4160098433494568},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39234864711761475},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.33131682872772217},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.3248657286167145},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28510093688964844},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.19570964574813843},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1481412947177887}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7647267580032349},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6086301803588867},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5778964757919312},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.5407623648643494},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5348765850067139},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.4609189033508301},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44835221767425537},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4161509573459625},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4160098433494568},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39234864711761475},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.33131682872772217},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3248657286167145},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28510093688964844},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.19570964574813843},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1481412947177887},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec.2018.8547539","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2018.8547539","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE High Performance extreme Computing Conference (HPEC)","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":20,"referenced_works":["https://openalex.org/W1748778977","https://openalex.org/W1969483458","https://openalex.org/W1977545325","https://openalex.org/W2006820476","https://openalex.org/W2017927472","https://openalex.org/W2039221685","https://openalex.org/W2057112598","https://openalex.org/W2084224084","https://openalex.org/W2085917651","https://openalex.org/W2122410182","https://openalex.org/W2169528473","https://openalex.org/W2617217604","https://openalex.org/W2623293810","https://openalex.org/W3137299218","https://openalex.org/W3145128584","https://openalex.org/W3198470706","https://openalex.org/W4205160467","https://openalex.org/W4246219036","https://openalex.org/W6637724201","https://openalex.org/W6800905369"],"related_works":["https://openalex.org/W8290509","https://openalex.org/W1528287146","https://openalex.org/W2065411828","https://openalex.org/W2365287931","https://openalex.org/W3092127654","https://openalex.org/W2184537587","https://openalex.org/W2010802092","https://openalex.org/W4246145339","https://openalex.org/W2552085130","https://openalex.org/W2098037505"],"abstract_inverted_index":{"Multiresolution":[0],"priority":[1],"queues":[2],"are":[3,151],"recently":[4],"introduced":[5],"data":[6],"structures":[7],"that":[8,71],"can":[9,132],"trade-off":[10],"a":[11,31,58,111,123,174],"small":[12],"bounded":[13,112],"error":[14,115],"for":[15],"faster":[16],"performance.":[17],"When":[18],"used":[19],"to":[20,35,77,168],"implement":[21],"the":[22,41,72,78,82,94,99,107,120,152],"frontier":[23],"set":[24,153],"in":[25,70,126],"label":[26,63],"setting":[27,64],"algorithms,":[28],"they":[29,53],"provide":[30],"new":[32],"mathematical":[33,59,74],"approach":[34],"classic":[36,73],"graph":[37,121,175],"problems":[38],"such":[39],"as":[40],"computation":[42],"of":[43,61,90,98,109,119,145,154,162,176],"shortest":[44],"paths":[45],"or":[46],"minimum":[47],"spanning":[48],"trees.":[49],"To":[50],"understand":[51],"how":[52],"work,":[54],"this":[55],"paper":[56],"presents":[57],"study":[60],"multiresolution":[62,91,139],"algorithms.":[65],"The":[66,88],"theory":[67],"is":[68,85,116],"general":[69],"results":[75],"respond":[76],"particular":[79],"case":[80],"where":[81,130,147],"problem's":[83],"resolution":[84],"infinitely":[86,134],"small.":[87],"concept":[89],"helps":[92],"break":[93],"information":[95],"theoretic":[96],"barriers":[97],"problem":[100],"by":[101],"achieving":[102],"lower":[103],"time":[104],"complexity":[105],"at":[106],"cost":[108,144],"introducing":[110],"error.":[113],"Such":[114],"proven":[117],"independent":[118],"size,":[122],"relevant":[124],"feature":[125],"uniform-cost":[127],"search":[128],"algorithms":[129,172],"graphs":[131],"be":[133],"large.":[135],"Properly":[136],"tuned,":[137],"Dijkstra's":[138,169],"algorithm":[140],"delivers":[141],"an":[142],"amortized":[143],"O(|V|+|E|),":[146],"V":[148],"and":[149,156,164,170,182],"E":[150],"vertices":[155,181],"edges,":[157],"respectively.":[158],"Benchmarks":[159],"show":[160],"speedups":[161],"53%":[163],"26%":[165],"when":[166],"applied":[167],"A*":[171],"on":[173],"US":[177],"roads":[178],"with":[179],"87,575":[180],"121,961":[183],"edges.":[184]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}