![](/img/cover-not-exists.png)
All-pairs nearly 2-approximate shortest paths in time
Surender Baswana, Vishrut Goyal, Sandeep SenVolume:
410
Year:
2009
Language:
english
Pages:
10
DOI:
10.1016/j.tcs.2008.10.018
File:
PDF, 1.03 MB
english, 2009