Single-source shortest paths in the CONGEST model with improved bounds
From MaRDI portal
Publication:2166365
DOI10.1007/s00446-021-00412-8OpenAlexW3216836550MaRDI QIDQ2166365
Publication date: 24 August 2022
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-021-00412-8
Related Items (2)
Minimum cost flow in the CONGEST model ⋮ Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model
Cites Work
- Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems
- Algebraic methods in the congested clique
- Fast Partial Distance Estimation and Applications
- Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
- Optimal distributed all pairs shortest paths and applications
- On a routing problem
- Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem
- A Randomized Parallel Algorithm for Single-Source Shortest Paths
- Distributed Computing: A Locality-Sensitive Approach
- Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford
- Distributed exact shortest paths in sublinear time
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
- Fast Approximate Shortest Paths in the Congested Clique
- Efficient distributed source detection with limited bandwidth
- A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds
- Distributed exact weighted all-pairs shortest paths in near-linear time
- Improved distributed algorithms for exact shortest paths
- Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths
- Distributed approximation algorithms for weighted shortest paths
- A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
- Distributed verification and hardness of distributed approximation
- Fast routing table construction using small messages
- Maintaining shortest paths under deletions in weighted directed graphs
This page was built for publication: Single-source shortest paths in the CONGEST model with improved bounds
