Faster algorithms for all-pairs approximate shortest paths in undirected graphs. (2010)

by S Baswana, T Kavitha
Venue:SIAM Journal on Computing,