Sciweavers

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

72

APPROX
2006
Springer

favoriteEmaildiscussreport

76views Algorithms» more APPROX 2006»

Distance Approximation in Bounded-Degree and General Sparse Graphs

15 years 2 months ago

Distance Approximation in Bounded-Degree and General Sparse Graphs

Download www.eng.tau.ac.il

Sharon Marko, Dana Ron

Real-time Traffic

Algorithms | APPROX 2006 |

claim paper

Related Content

» Local Graph Partitions for Approximation and Testing

» Improved Approximation of MAXCUT on Graphs of Bounded Degree

» Approximating minimum bounded degree spanning trees to within one of optimal

» Grad and classes with bounded expansion III Restricted graph homomorphism dualities

» Approximate distance queries and compact routing in sparse graphs

» Faster Approximate Distance Queries and Compact Routing in Sparse Graphs

» Vertex Cover in Graphs with Locally Few Colors

» CKR Partitions of Sparse Graphs

» Local Algorithms for Approximate Inference in MinorExcluded Graphs

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	APPROX
Authors	Sharon Marko, Dana Ron

Comments (0)