Searching for "Computing almost shortest paths." – sorted by Relevance.
7 documents found, showing 1 through 7.
-
Computing Almost Shortest Paths
- … Computing Almost Shortest Paths \Lambda Michael Elkin \Lambda Abstract We study the s…
- Cited by 32 (10 self) – Add To MetaCart
-
Efficient algorithms for constructing (1 + ɛ, β)-spanners in the distributed and streaming models
- …) bits of space for computing allpairs-almost-shortest-paths of length at most by a multiplicative factor…
- Cited by 11 (6 self) – Add To MetaCart
-
unknown title
- …(n)- approximate distance computation requires \Omega (n) bits of space. Keywords: Spanner - Almost Shortest Paths…
- Add To MetaCart
-
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
- …-stretch routing schemes using small routing tables (see [6,30] and the references therein), computing almost…
- Cited by 1 (0 self) – Add To MetaCart
-
A Faster Distributed Protocol for Constructing a Minimum Spanning Tree
- … synchronization, in [10] for routing, and in [4, 15] for computing almost shortest paths and constructing spanners…
- Cited by 18 (2 self) – Add To MetaCart
-
New Length Bounds for Cycle Bases ∗
- …. The latter variant employs a recent result of Baswana and Kavitha [BK06] for computing almost shortest paths…
- Add To MetaCart
-
Sparse source-wise and pair-wise distance preservers
- …. Among the most prominent applications of spanners are algorithms for com-puting almost shortest paths [2…
- Cited by 6 (0 self) – Add To MetaCart
Showing 1 through 7.
