Computer Science – Data Structures and Algorithms
Scientific paper
2008-08-14
Computer Science
Data Structures and Algorithms
Scientific paper
We prove that any graph $G$ with $n$ points has a distribution $\mathcal{T}$
over spanning trees such that for any edge $(u,v)$ the expected stretch $E_{T
\sim \mathcal{T}}[d_T(u,v)/d_G(u,v)]$ is bounded by $\tilde{O}(\log n)$. Our
result is obtained via a new approach of building ``highways'' between portals
and a new strong diameter probabilistic decomposition theorem.
Abraham Ittai
Bartal Yair
Neiman Ofer
No associations
LandOfFree
Nearly Tight Low Stretch Spanning Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Nearly Tight Low Stretch Spanning Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nearly Tight Low Stretch Spanning Trees will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-584813