Sciweavers

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

98

Voted

FOCS
2006
IEEE

107views Theoretical Computer Science» more FOCS 2006»

Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths

15 years 8 months ago

Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths

Download www.cse.iitk.ac.in

Surender Baswana, Telikepalli Kavitha

Real-time Traffic

FOCS 2006 | Theoretical Computer Science |

claim paper

Related Content

» Faster Approximate Distance Queries and Compact Routing in Sparse Graphs

» Faster Algorithms for Allpairs Approximate Shortest Paths in Undirected Graphs

» Approximate Shortest Paths Guided by a Small Index

» Approximating the Stretch Factor of Euclidean Graphs

» Distance Oracles for Sparse Graphs

» Reduce the stretch in surface flattening by finding cutting paths to the surface boundary

» Faster Approximation of Distances in Graphs

» Minimizing Average Shortest Path Distances via Shortcut Edge Addition

» Object location using path separators

Post Info
More Details (n/a)

Added	11 Jun 2010
Updated	11 Jun 2010
Type	Conference
Year	2006
Where	FOCS
Authors	Surender Baswana, Telikepalli Kavitha

Comments (0)