{"id":"https://openalex.org/W3034903651","doi":"https://doi.org/10.1145/3357713.3384321","title":"Parallel approximate undirected shortest paths via low hop emulators","display_name":"Parallel approximate undirected shortest paths via low hop emulators","publication_year":2020,"publication_date":"2020-06-06","ids":{"openalex":"https://openalex.org/W3034903651","doi":"https://doi.org/10.1145/3357713.3384321","mag":"3034903651"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384321","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384321","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088346829","display_name":"Alexandr Andoni","orcid":"https://orcid.org/0009-0004-8042-0976"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexandr Andoni","raw_affiliation_strings":["Columbia University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Columbia University, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054641291","display_name":"Clifford Stein","orcid":"https://orcid.org/0000-0002-0614-6620"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Clifford Stein","raw_affiliation_strings":["Columbia University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Columbia University, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062439923","display_name":"Peilin Zhong","orcid":"https://orcid.org/0009-0001-1136-9538"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peilin Zhong","raw_affiliation_strings":["Columbia University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Columbia University, USA","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I78577930"],"apc_list":null,"apc_paid":null,"fwci":13.8374,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.99614726,"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":"322","last_page":"335"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.9973999857902527,"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/T12288","display_name":"Optimization and Search Problems","score":0.9973000288009644,"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/combinatorics","display_name":"Combinatorics","score":0.6024339199066162},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5805324912071228},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.509507954120636},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49952077865600586},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4798142910003662},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4393406808376312},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4231262803077698},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3774499297142029},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3462282419204712},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3305304944515228},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2635194659233093}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6024339199066162},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5805324912071228},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.509507954120636},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49952077865600586},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4798142910003662},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4393406808376312},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4231262803077698},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3774499297142029},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3462282419204712},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3305304944515228},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2635194659233093},{"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/3357713.3384321","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384321","pdf_url":null,"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":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4007009450","display_name":null,"funder_award_id":"#491119 to Alexandr Andoni","funder_id":"https://openalex.org/F4320314817","funder_display_name":"Heising-Simons Foundation"},{"id":"https://openalex.org/G8070826927","display_name":null,"funder_award_id":"CCF-1617955,CCF- 1740833,CCF-1714818,CCF-1822809,CCF-1703925","funder_id":"https://openalex.org/F4320315254","funder_display_name":"Innovative Research Group Project of the National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"},{"id":"https://openalex.org/F4320314817","display_name":"Heising-Simons Foundation","ror":"https://ror.org/01mp52y34"},{"id":"https://openalex.org/F4320315254","display_name":"Innovative Research Group Project of the National Natural Science Foundation of China","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":59,"referenced_works":["https://openalex.org/W1503698146","https://openalex.org/W1945584931","https://openalex.org/W1968729061","https://openalex.org/W1986816824","https://openalex.org/W1987099434","https://openalex.org/W1996194724","https://openalex.org/W1999545213","https://openalex.org/W2003969379","https://openalex.org/W2006208025","https://openalex.org/W2008199814","https://openalex.org/W2012776084","https://openalex.org/W2014317399","https://openalex.org/W2025919541","https://openalex.org/W2033698604","https://openalex.org/W2038073775","https://openalex.org/W2044112344","https://openalex.org/W2045446569","https://openalex.org/W2051586153","https://openalex.org/W2056148792","https://openalex.org/W2056496054","https://openalex.org/W2057082426","https://openalex.org/W2063491776","https://openalex.org/W2073647817","https://openalex.org/W2082210092","https://openalex.org/W2084224084","https://openalex.org/W2084990336","https://openalex.org/W2085630237","https://openalex.org/W2087608922","https://openalex.org/W2100830825","https://openalex.org/W2106759055","https://openalex.org/W2120994821","https://openalex.org/W2133352257","https://openalex.org/W2149565746","https://openalex.org/W2150187954","https://openalex.org/W2150865801","https://openalex.org/W2153441719","https://openalex.org/W2173213060","https://openalex.org/W2189465200","https://openalex.org/W2208409594","https://openalex.org/W2269957429","https://openalex.org/W2568484534","https://openalex.org/W2569289043","https://openalex.org/W2624960300","https://openalex.org/W2767763836","https://openalex.org/W2902652525","https://openalex.org/W2902989566","https://openalex.org/W2954037053","https://openalex.org/W2963015907","https://openalex.org/W2963618817","https://openalex.org/W2963983736","https://openalex.org/W2964294252","https://openalex.org/W2981949299","https://openalex.org/W3030774092","https://openalex.org/W3034415339","https://openalex.org/W3034903651","https://openalex.org/W3037094428","https://openalex.org/W3101974321","https://openalex.org/W4239429564","https://openalex.org/W6687322159"],"related_works":["https://openalex.org/W2147954430","https://openalex.org/W1604162242","https://openalex.org/W2031552172","https://openalex.org/W4297688303","https://openalex.org/W2178484001","https://openalex.org/W2732982824","https://openalex.org/W2622090745","https://openalex.org/W3196638783","https://openalex.org/W4230677477","https://openalex.org/W4384919997"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,46],"(1+\u03b5)-approximate":[3],"parallel":[4,39],"algorithm":[5],"for":[6,20,35,65,81],"computing":[7],"shortest":[8],"paths":[9],"in":[10],"undirected":[11],"graphs,":[12],"achieving":[13],"poly(logn)":[14,18,56],"depth":[15,57],"and":[16],"m":[17],"work":[19,64],"n-nodes":[21],"m-edges":[22],"graphs.":[23],"Although":[24],"sequential":[25],"algorithms":[26,40,54],"with":[27,55],"(nearly)":[28],"optimal":[29],"running":[30],"time":[31],"have":[32,41],"been":[33,79],"known":[34],"several":[36],"decades,":[37],"near-optimal":[38],"turned":[42],"out":[43],"to":[44],"be":[45],"much":[47],"tougher":[48],"challenge.":[49],"For":[50],"(1+\u03b5)-approximation,":[51],"all":[52],"prior":[53],"perform":[58],"at":[59],"least":[60],"\u03a9(mn":[61],"c":[62],")":[63],"some":[66],"constant":[67],"c>0.":[68],"Improving":[69],"this":[70],"long-standing":[71],"upper":[72],"bound":[73],"obtained":[74],"by":[75],"Cohen":[76],"(STOC\u201994)":[77],"has":[78],"open":[80],"25":[82],"years.":[83]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":1}],"updated_date":"2026-08-24T07:32:12.397491","created_date":"2025-10-10T00:00:00"}