All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog n) Time. - Surender Baswana; Vishrut Goyal; Sandeep Sen (STACS, 2005)

All-pairs nearly 2-approximate shortest paths in I time. - Surender Baswana; Vishrut Goyal; Sandeep Sen (Theor. Comput. Sci., 2009)