{"id":"https://openalex.org/W4281700498","doi":"https://doi.org/10.1145/3519935.3520074","title":"Undirected (1+ <i>\ud835\udf00</i> )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms","display_name":"Undirected (1+ <i>\ud835\udf00</i> )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W4281700498","doi":"https://doi.org/10.1145/3519935.3520074"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3520074","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520074","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-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/A5062638895","display_name":"V\u00e1clav Rozho\u0148","orcid":"https://orcid.org/0000-0002-9646-8446"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"V\u00e1clav Rozho\u0148","raw_affiliation_strings":["ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101735840","display_name":"Christoph Grunau","orcid":"https://orcid.org/0000-0002-1057-9429"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Christoph Grunau","raw_affiliation_strings":["ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459"},"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"]},{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH","US"],"is_corresponding":false,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":["ETH Zurich, Switzerland / Carnegie Mellon University, USA"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland / Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139","https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016898359","display_name":"Goran \u017du\u017ei\u0107","orcid":"https://orcid.org/0000-0002-9322-6329"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Goran Zuzic","raw_affiliation_strings":["ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100762970","display_name":"Jason Li","orcid":"https://orcid.org/0000-0002-1150-3549"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jason Li","raw_affiliation_strings":["University of California at Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5062638895"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":2.9211,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.92050856,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"478","last_page":"487"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9941999912261963,"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/undirected-graph","display_name":"Undirected graph","score":0.8045065402984619},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6549022197723389},{"id":"https://openalex.org/keywords/minor","display_name":"Minor (academic)","score":0.5325447916984558},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.5094841122627258},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49887895584106445},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4559079706668854},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.45118409395217896},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3354009985923767},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3119651675224304},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2717277705669403},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.14151331782341003}],"concepts":[{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.8045065402984619},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6549022197723389},{"id":"https://openalex.org/C2779760435","wikidata":"https://www.wikidata.org/wiki/Q5396169","display_name":"Minor (academic)","level":2,"score":0.5325447916984558},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.5094841122627258},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49887895584106445},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4559079706668854},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.45118409395217896},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3354009985923767},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3119651675224304},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2717277705669403},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.14151331782341003},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519935.3520074","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520074","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W1970052762","https://openalex.org/W1984090926","https://openalex.org/W1986816824","https://openalex.org/W2014317399","https://openalex.org/W2040011014","https://openalex.org/W2056148792","https://openalex.org/W2056496054","https://openalex.org/W2075862701","https://openalex.org/W2082210092","https://openalex.org/W2083323175","https://openalex.org/W2097747425","https://openalex.org/W2112702616","https://openalex.org/W2140097884","https://openalex.org/W2151757686","https://openalex.org/W2186715137","https://openalex.org/W2293001982","https://openalex.org/W2484918492","https://openalex.org/W2515165863","https://openalex.org/W2618199688","https://openalex.org/W2624960300","https://openalex.org/W2767763836","https://openalex.org/W2793058913","https://openalex.org/W2793130010","https://openalex.org/W2903356572","https://openalex.org/W2949824190","https://openalex.org/W2951926403","https://openalex.org/W2954037053","https://openalex.org/W2962991864","https://openalex.org/W2963618817","https://openalex.org/W2963948050","https://openalex.org/W2965442570","https://openalex.org/W2970898478","https://openalex.org/W2981949299","https://openalex.org/W3034415339","https://openalex.org/W3034790637","https://openalex.org/W3034903651","https://openalex.org/W3046699603","https://openalex.org/W3101974321","https://openalex.org/W3104014862","https://openalex.org/W3117607498","https://openalex.org/W3170201847","https://openalex.org/W3172739028","https://openalex.org/W3174348403","https://openalex.org/W3185108837","https://openalex.org/W3185869381","https://openalex.org/W3187061951","https://openalex.org/W3210104991","https://openalex.org/W4205300528","https://openalex.org/W4210697874","https://openalex.org/W4229679398","https://openalex.org/W4254419859","https://openalex.org/W4281778715","https://openalex.org/W4297079376","https://openalex.org/W6734199730"],"related_works":["https://openalex.org/W2368619281","https://openalex.org/W2377143628","https://openalex.org/W2355995962","https://openalex.org/W2392462513","https://openalex.org/W2362718971","https://openalex.org/W2368173763","https://openalex.org/W2977970519","https://openalex.org/W191560551","https://openalex.org/W2361081252","https://openalex.org/W1994341438"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"near-optimal":[3],"deterministic":[4],"parallel":[5],"and":[6],"distributed":[7],"algorithms":[8],"for":[9],"computing":[10],"(1+eps)-approximate":[11],"single-source":[12],"shortest":[13],"paths":[14],"in":[15],"any":[16],"undirected":[17],"weighted":[18],"graph.":[19]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}