Baswana, Surender Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Sen, Sandeep Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Baswana, S., Goyal, V., & Sen, S. (2005). All-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time. In STACS 2005: 22nd Annual Symposium on Theoretical Aspects of Computer Science (pp. 666-679). Berlin, Germany: Springer.