An almost 2-approximation for all-pairs of shortest paths in subquadratic time. - Maor Akav; Liam Roditty (SODA, 2020)

A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs. - Maor Akav; Liam Roditty (ESA, 2021)