Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

STACS
2005
Springer

favoriteEmaildiscussreport

110views Theoretical Computer Science» more STACS 2005»

All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog n) Time

14 years 6 months ago

All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog n) Time

Download www.cse.iitd.ernet.in

Surender Baswana, Vishrut Goyal, Sandeep Sen

Real-time Traffic

STACS 2005 | Theoretical Computer Science |

claim paper

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	STACS
Authors	Surender Baswana, Vishrut Goyal, Sandeep Sen

Comments (0)