1. Agarwal, U., Ramachandran, V.: Distributed weighted all pairs shortest paths through pipelining. In: Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS ’19), pp. 23–32, (2019)
2. Agarwal, U., Ramachandran, V., King, V., Pontecorvi, M.: A deterministic distributed algorithm for exact weighted all-pairs shortest paths in $$\tilde{O}(n^{3/2})$$ rounds. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (PODC ’18), pp. 199–205, (2018)
3. Becker, R., Emek, Y., Ghaffari, M., Lenzen, C.: Distributed algorithms for low stretch spanning trees. In: Proceedings of the 33rd International Symposium on Distributed Computing (DISC ’19), pp. 4:1–4:14, (2019)
4. Becker, R., Karrenbauer, A., Krinninger, S., Lenzen, C.: Near-optimal approximate shortest paths and transshipment in distributed and streaming models. In: Proceedings of the 31st International Symposium on Distributed Computing (DISC ’17), pp. 7:1–7:16, (2017)
5. Bellman, R.: On a routing problem. Q. Appl. Math. 16(1), 87–90 (1958)