Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
23
click to vote
FOCS
2006
IEEE
favorite
Email
discuss
report
107
views
Theoretical Computer Science
»
more
FOCS 2006
»
Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths
14 years 2 months ago
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
more »
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)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision