All-pairs nearly 2-approximate shortest paths in o(n2poly logn) time (0)

by S Baswana, V Goyal, S Sen
Venue:Theor. Comput. Sci