{"id":"https://openalex.org/W3034415339","doi":"https://doi.org/10.1145/3357713.3384268","title":"Faster parallel algorithm for approximate shortest path","display_name":"Faster parallel algorithm for approximate shortest path","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3034415339","doi":"https://doi.org/10.1145/3357713.3384268","mag":"3034415339"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384268","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384268","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384268","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384268","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100762970","display_name":"Jason Li","orcid":"https://orcid.org/0000-0002-1150-3549"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jason Li","raw_affiliation_strings":["Carnegie Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100762970"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":11.4463,"has_fulltext":true,"cited_by_count":48,"citation_normalized_percentile":{"value":0.99484868,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"308","last_page":"321"},"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.9995999932289124,"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.9995999932289124,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/computer-science","display_name":"Computer science","score":0.6550016403198242},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6192688941955566},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5905365943908691},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.523706316947937},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5162753462791443},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49805188179016113},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4667525589466095},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44993048906326294},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.3604332208633423},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.35101211071014404},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2959141731262207},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09729313850402832},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07234123349189758}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6550016403198242},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6192688941955566},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5905365943908691},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.523706316947937},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5162753462791443},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49805188179016113},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4667525589466095},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44993048906326294},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.3604332208633423},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.35101211071014404},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2959141731262207},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09729313850402832},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07234123349189758}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3357713.3384268","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384268","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384268","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3357713.3384268","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384268","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384268","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320319077","display_name":"Society for the Study of School Psychology","ror":"https://ror.org/00gz9xf10"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3034415339.pdf","grobid_xml":"https://content.openalex.org/works/W3034415339.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W136016496","https://openalex.org/W596522316","https://openalex.org/W1447961680","https://openalex.org/W1509805685","https://openalex.org/W1973117121","https://openalex.org/W1996194724","https://openalex.org/W2045107949","https://openalex.org/W2056496054","https://openalex.org/W2066308383","https://openalex.org/W2072142932","https://openalex.org/W2073647817","https://openalex.org/W2084990336","https://openalex.org/W2085630237","https://openalex.org/W2099143789","https://openalex.org/W2129027292","https://openalex.org/W2141793995","https://openalex.org/W2153441719","https://openalex.org/W2167732364","https://openalex.org/W2169528477","https://openalex.org/W2176446742","https://openalex.org/W2208409594","https://openalex.org/W2251847018","https://openalex.org/W2278710066","https://openalex.org/W2345496427","https://openalex.org/W2503099161","https://openalex.org/W2774720496","https://openalex.org/W2900806478","https://openalex.org/W2912310074","https://openalex.org/W2912637539","https://openalex.org/W2914050705","https://openalex.org/W2914612129","https://openalex.org/W2950657392","https://openalex.org/W2951368770","https://openalex.org/W2964070308","https://openalex.org/W2979473749","https://openalex.org/W3101974321","https://openalex.org/W4238717878","https://openalex.org/W4239237828","https://openalex.org/W4242904825","https://openalex.org/W6679283053"],"related_works":["https://openalex.org/W4253588386","https://openalex.org/W2810620529","https://openalex.org/W2381419702","https://openalex.org/W2375775343","https://openalex.org/W2523719706","https://openalex.org/W2161960576","https://openalex.org/W2368964068","https://openalex.org/W4293054712","https://openalex.org/W2198982833","https://openalex.org/W1562631103"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,11,27,49,57,64,69,72,91,109,114,145],"first":[3],"m":[4,148],"polylog(n)":[5,7,40],"work,":[6,87],"time":[8],"algorithm":[9,54,105,140,152],"in":[10,60,141],"PRAM":[12],"model":[13],"that":[14,33,106],"computes":[15],"(1+\u0454)-approximate":[16],"single-source":[17],"shortest":[18,65,95],"paths":[19],"on":[20,117],"weighted,":[21],"undirected":[22],"graphs.":[23],"This":[24],"improves":[25,143],"upon":[26,56,144],"breakthrough":[28],"result":[29],"of":[30,51,71,85,93,153],"Cohen":[31],"[JACM\u201900]":[32],"achieves":[34],"O(m":[35],"1+\u04540":[36],")":[37],"work":[38,150],"and":[39,99,101,112,132],"time.":[41],"While":[42],"most":[43],"previous":[44,146],"approaches,":[45],"including":[46],"Cohen\u2019s,":[47],"leveraged":[48],"power":[50],"hopsets,":[52],"our":[53,79],"builds":[55],"recent":[58],"developments":[59],"continuous":[61],"optimization,":[62],"studying":[63],"path":[66],"problem":[67],"from":[68],"lens":[70],"closely-related":[73],"minimum":[74,138],"transshipment":[75,131,139],"problem.":[76],"To":[77],"obtain":[78,125],"algorithm,":[80],"we":[81,123],"demonstrate":[82],"a":[83,103,121],"series":[84],"near-linear":[86],"polylogarithmic-time":[88],"reductions":[89],"between":[90],"problems":[92,111],"approximate":[94,97,130],"path,":[96],"transshipment,":[98],"\u21131-embeddings,":[100],"establish":[102],"recursive":[104],"cycles":[107],"through":[108],"three":[110],"reduces":[113],"graph":[115],"size":[116],"each":[118],"cycle.":[119],"As":[120],"consequence,":[122],"also":[124],"faster":[126],"parallel":[127],"algorithms":[128],"for":[129],"\u21131-embeddings":[133],"with":[134],"polylogarithmic":[135],"distortion.":[136],"The":[137],"particular":[142],"best":[147],"1+o(1)":[149],"sequential":[151],"Sherman":[154],"[SODA\u201917].":[155]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}