An almost 2-approximation for all-pairs of shortest paths in subquadratic time

Maor Akav, Liam Roditty. An almost 2-approximation for all-pairs of shortest paths in subquadratic time. In Shuchi Chawla 0001, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020. pages 1-11, SIAM, 2020. [doi]

Abstract

Abstract is missing.