Join Our Newsletter

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

WADS

2007

Springer

2007

Springer

Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the original graph in addition to the graph excerpt while computing paths. This allows for asymptotically much smaller excerpts than distance oracles or spanners. The quality of an algorithm in this setting is measured by the size of the excerpt (in bits), by how much of the original graph is accessed (in number of edges), and the stretch of the computed path (as the ratio between the length of the path and the distance between its end points). Because these three objectives are conﬂicting goals, we are interested in a good trade-oﬀ. We measure the number of accesses to the graph relative to the number of edges in the computed path. We present a parametrized construction that, for constant stretches, achieves excerpt sizes and number of accessed edges that are both sublinear in the number of graph vertices. We a...

Related Content

Added |
09 Jun 2010 |

Updated |
09 Jun 2010 |

Type |
Conference |

Year |
2007 |

Where |
WADS |

Authors |
Jörg Derungs, Riko Jacob, Peter Widmayer |

Comments (0)