Distributed exact weighted all-pairs shortest paths in near-linear time-Reference-Cited by-同舟云学术

Distributed exact weighted all-pairs shortest paths in near-linear time

Published:2019-06-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Bernstein Aaron¹,Nanongkai Danupon²

Affiliation:

1. Rutgers University, USA

2. KTH, Sweden

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3313276.3316326

Reference63 articles.

1. Udit Agarwal and Vijaya Ramachandran. 2018. New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths. CoRR abs/1810.08544 (2018). Udit Agarwal and Vijaya Ramachandran. 2018. New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths. CoRR abs/1810.08544 (2018).

2. Udit Agarwal and Vijaya Ramachandran. 2019. Udit Agarwal and Vijaya Ramachandran. 2019.

3. A Deterministic Distributed Algorithm for Weighted All Pairs Shortest Paths Through Pipelining. IPDPS (2019). A Deterministic Distributed Algorithm for Weighted All Pairs Shortest Paths Through Pipelining. IPDPS (2019).

4. Udit Agarwal Vijaya Ramachandran Valerie King and Matteo Pontecorvi. 2018. Udit Agarwal Vijaya Ramachandran Valerie King and Matteo Pontecorvi. 2018.

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Enhanced Backpressure Routing Using Wireless Link Features;2023 IEEE 9th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP);2023-12-10

2. Delay-Aware Backpressure Routing Using Graph Neural Networks;ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP);2023-06-04

3. EdgeDecAp: An auction-based decentralized algorithm for optimizing application placement in edge computing;Journal of Parallel and Distributed Computing;2023-05

4. ZePoP: A Distributed Leader Election Protocol using the Delay-based Closeness Centrality for Peer-to-Peer Applications;SSRN Electronic Journal;2023

5. Nearly Optimal Communication and Query Complexity of Bipartite Matching;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10