9 search results - page 1 / 2 » Nearly Tight Low Stretch Spanning Trees |
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We prove that any graph G with n points has a distribution T over spanning trees such that for any edge (u, v) the expected stretch ET ∼T [dT (u, v)/dG(u, v)] is bounded by ˜O(...
ESA
2009
Springer
13 years 11 months ago
2009
Springer
SIAMCOMP
2000
13 years 4 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T) = O(k · n1/k ) · w(MST(M)), an...