Exponentially Faster Shortest Paths in the Congested Clique

DOI10.1145/3527213MaRDI QIDQ5889790zbMATH OpenOpenAlexWikidataFDO

Authors Michal Dory, M. Parter

Publication date 27 April 2023

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3527213

zbMATH Keywords

congested cliquenear-additive emulatorshortest paths

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Exponentially Faster Shortest Paths in the Congested Clique
• Fast approximate shortest paths in the congested clique
• Fast Approximate Shortest Paths in the Congested Clique
• Approximation of distances and shortest paths in the broadcast congest clique
• A deterministic almost-tight distributed algorithm for approximating single-source shortest paths

Cited in

(8)

• Fast Approximate Shortest Paths in the Congested Clique
• Exponentially Faster Shortest Paths in the Congested Clique
• Near-constant-time distributed algorithms on a congested clique
• New tradeoffs for decremental approximate all-pairs shortest paths
• Hardness and algorithms for several new optimization problems on the weighted massively parallel computation model
• Massively parallel algorithms for approximate shortest paths
• Improved all-pairs approximate shortest paths in congested clique
• Improved all-pairs approximate shortest paths in congested clique

This page was built for publication: Exponentially Faster Shortest Paths in the Congested Clique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5889790)