{"id":"https://openalex.org/W2900102855","doi":"https://doi.org/10.1145/3313276.3316326","title":"Distributed exact weighted all-pairs shortest paths in near-linear time","display_name":"Distributed exact weighted all-pairs shortest paths in near-linear time","alternate_titles":[],"publication_year":2019,"publication_date":"2019-06-23","ids":{"openalex":"https://openalex.org/W2900102855","doi":"https://doi.org/10.1145/3313276.3316326","mag":"2900102855"},"language":"en","primary_location":{"id":"doi:10.1145/3313276.3316326","doi":"https://doi.org/10.1145/3313276.3316326","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3313276.3316326","pdf_url":null,"source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2900102855"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1811.03337","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033889707","display_name":"Aaron Bernstein","orcid":"https://orcid.org/0000-0002-7599-2679","observed_orcids":["https://orcid.org/0000-0002-7599-2679"]},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Aaron Bernstein","raw_affiliation_strings":["Rutgers University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074369690","display_name":"Danupon Nanongkai","orcid":"https://orcid.org/0000-0003-4468-2675","observed_orcids":["https://orcid.org/0000-0003-4468-2675"]},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Danupon Nanongkai","raw_affiliation_strings":["KTH, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.4448,"has_fulltext":true,"cited_by_count":56,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.96879509,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"334","last_page":"342"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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.9994999766349792,"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/T12292","display_name":"Graph Theory and Algorithms","score":9.999999747378752e-05,"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/T12288","display_name":"Optimization and Search Problems","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/congest-model","display_name":"CONGEST model","score":0.7739999890327454},{"id":"https://openalex.org/keywords/weighted-undirected-graphs","display_name":"weighted undirected graphs","score":0.7990000247955322},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.6179999709129333},{"id":"https://openalex.org/keywords/directed-communication","display_name":"directed communication","score":0.3310000002384186}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7883321642875671},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6801101565361023},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6723665595054626},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5925807356834412},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.587749719619751},{"id":"https://openalex.org/C36686422","wikidata":"https://www.wikidata.org/wiki/Q11167","display_name":"Tilde","level":2,"score":0.5656335949897766},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49316638708114624},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4367968440055847},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.42606014013290405},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4199594557285309},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24937137961387634},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1442413628101349},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07449150085449219},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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":5,"locations":[{"id":"doi:10.1145/3313276.3316326","doi":"https://doi.org/10.1145/3313276.3316326","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3313276.3316326","pdf_url":null,"source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1811.03337","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1811.03337","pdf_url":"https://arxiv.org/pdf/1811.03337","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2900102855","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1811.03337.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:alma.01RUT_INST:11664927450004646","doi":null,"is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/other/Distributed-exact-weighted-all-pairs-shortest-paths/991031665403404646","pdf_url":null,"source":{"id":"https://openalex.org/S4306401388","display_name":"Rutgers University Community Repository (Rutgers University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I102322142","host_organization_name":"Rutgers, The State University of New Jersey","host_organization_lineage":["https://openalex.org/I102322142"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"physicalOjbect"},{"id":"doi:10.48550/arxiv.1811.03337","doi":"https://doi.org/10.48550/arxiv.1811.03337","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1811.03337","pdf_url":"https://arxiv.org/pdf/1811.03337","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1811.03337","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1811.03337","pdf_url":"https://arxiv.org/pdf/1811.03337","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G1981933775","display_name":"Algorithms and Complexity for Dynamic Graph Problems","funder_award_id":"2015-04659","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G434337789","display_name":null,"funder_award_id":"HORIZON2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G895032013","display_name":"Distributed and Dynamic Graph Algorithms and Complexity","funder_award_id":"715672","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2900102855.pdf","grobid_xml":"https://content.openalex.org/works/W2900102855.grobid-xml"},"referenced_works_count":48,"referenced_works":["https://openalex.org/W147275194","https://openalex.org/W1497938971","https://openalex.org/W1500483810","https://openalex.org/W1508113861","https://openalex.org/W1534484868","https://openalex.org/W1568961751","https://openalex.org/W1582638066","https://openalex.org/W1605733898","https://openalex.org/W1974912205","https://openalex.org/W1984090926","https://openalex.org/W1993913882","https://openalex.org/W2006444174","https://openalex.org/W2015819397","https://openalex.org/W2022980325","https://openalex.org/W2026798971","https://openalex.org/W2030825457","https://openalex.org/W2040011014","https://openalex.org/W2040273581","https://openalex.org/W2048098617","https://openalex.org/W2058191123","https://openalex.org/W2083323175","https://openalex.org/W2098745256","https://openalex.org/W2101014999","https://openalex.org/W2107282727","https://openalex.org/W2116055396","https://openalex.org/W2121852952","https://openalex.org/W2163097371","https://openalex.org/W2227557434","https://openalex.org/W2399682168","https://openalex.org/W2486560399","https://openalex.org/W2592535728","https://openalex.org/W2592613193","https://openalex.org/W2767763836","https://openalex.org/W2895866428","https://openalex.org/W2896802580","https://openalex.org/W2897112965","https://openalex.org/W2911409877","https://openalex.org/W2937529321","https://openalex.org/W2949524113","https://openalex.org/W2949607604","https://openalex.org/W2949855858","https://openalex.org/W2952490263","https://openalex.org/W2963245981","https://openalex.org/W2963528540","https://openalex.org/W2963948050","https://openalex.org/W2963978988","https://openalex.org/W4246068349","https://openalex.org/W4256354285"],"related_works":["https://openalex.org/W2963528540","https://openalex.org/W3216768296","https://openalex.org/W2895866428","https://openalex.org/W2963245981","https://openalex.org/W2949607604","https://openalex.org/W2884021615","https://openalex.org/W2897112965","https://openalex.org/W4411320057"],"abstract_inverted_index":{"In":[0,161],"the":[1,11,22,57,110,116,136,144,164,180,188],"distributed":[2,14],"all-pairs":[3],"shortest":[4],"paths":[5],"problem":[6,39],"(APSP),":[7],"every":[8,25],"node":[9,27],"in":[10,75,171,184,209],"weighted":[12],"undirected":[13],"network":[15],"(the":[16],"CONGEST":[17],"model)":[18],"needs":[19],"to":[20,73,140,163,197,207,234],"know":[21],"distance":[23],"from":[24],"other":[26],"using":[28],"least":[29],"number":[30],"of":[31],"communication":[32,189],"rounds":[33],"(typically":[34],"called":[35],"time":[36,67,225],"complexity).":[37],"The":[38,214],"admits":[40],"(1+o(1))-approximation":[41],"\u0398(n)-time":[42],"algorithm":[43,108,169,217],"and":[44,53,199,227],"a":[45,90,106,129,172],"nearly-tight":[46],"\u03a9(n)":[47],"lower":[48,85,137],"bound":[49,86,138],"[Nanongkai,":[50],"STOC\u201914;":[51],"Lenzen":[52],"Patt-Shamir":[54],"PODC\u201915].":[55],"For":[56],"exact":[58,111],"case,":[59,112],"Elkin":[60],"[STOC\u201917]":[61],"presented":[62],"an":[63],"O(n5/3":[64],"log2/3":[65],"n)":[66,88],"bound,":[68,147],"which":[69,113],"was":[70,80],"later":[71],"improved":[72,165,233],"\u00d5(n5/4)":[74,146,182],"[Huang,":[76],"Nanongkai,":[77],"Saranurak":[78],"FOCS\u201917].It":[79],"shown":[81],"that":[82,177],"any":[83],"super-linear":[84],"(in":[87],"requires":[89],"new":[91],"technique":[92],"[Censor-Hillel,":[93],"Khoury,":[94],"Paz,":[95],"DISC\u201917],":[96],"but":[97],"otherwise":[98],"it":[99],"remained":[100],"widely":[101],"open":[102],"whether":[103],"there":[104],"exists":[105],"\u00d5(n)-time":[107,133],"for":[109,151,218],"would":[114],"match":[115],"best":[117,216],"possible":[118],"approximation":[119],"algorithm.":[120],"This":[121],"paper":[122],"resolves":[123],"this":[124,219],"question":[125],"positively:":[126],"we":[127],"present":[128],"randomized":[130],"(Las":[131],"Vegas)":[132],"algorithm,":[134],"matching":[135],"up":[139],"polylogarithmic":[141],"factors.":[142],"Like":[143],"previous":[145,181],"our":[148,168,185],"result":[149],"works":[150,170],"directed":[152],"graphs":[153],"with":[154],"zero":[155],"(and":[156],"even":[157],"negative)":[158],"edge":[159,193,201],"weights.":[160],"addition":[162],"running":[166],"time,":[167],"more":[173,220],"general":[174],"setting":[175,186,222],"than":[176],"required":[178,223],"by":[179],"bound;":[183],"(i)":[187],"is":[190],"only":[191],"along":[192],"directions":[194],"(as":[195,205],"opposed":[196,206],"bidirectional),":[198],"(ii)":[200],"weights":[202],"are":[203],"arbitrary":[204],"integers":[208],"{1,":[210],"2,":[211],"...":[212],"poly(n)}).":[213],"previously":[215],"difficult":[221],"\u00d5(n3/2)":[224],"[Agarwal":[226],"Ramachandran,":[228],"ArXiv\u201918]":[229],"(this":[230],"can":[231],"be":[232],"\u00d5(n4/3)":[235],"if":[236],"one":[237],"allows":[238],"bidirectional":[239],"communication).":[240]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2900102855","counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":1}],"updated_date":"2026-11-20T13:11:24.684918","created_date":"2018-11-16T00:00:00"}
