Abstract:
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, nu)/dG(u, nu)] is bounded b...Show MoreMetadata
Abstract:
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, nu)/dG(u, nu)] is bounded by Otilde(log n). Our result is obtained via a new approach of building "highways" between portals and a new strong diameter probabilistic decomposition theorem.
Date of Conference: 25-28 October 2008
Date Added to IEEE Xplore: 02 December 2008
Print ISBN:978-0-7695-3436-7
Print ISSN: 0272-5428