All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time
scientific article; zbMATH DE number 5509591
scientific article