History

Please fill in your query. A complete syntax description you will find on the General Help page.
Distributed algorithms for ultrasparse spanners and linear size skeletons. (English)
Distrib. Comput. 22, No. 3, 147-166 (2010).
Summary: We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, sparseness, and distortion. All of our algorithms assume a synchronized distributed network, where relatively short messages may be communicated in each time step. Our first result is a fast distributed algorithm for finding an $O(2^{\log^* n} \log n)$-spanner with size $O(n)$. Besides being nearly optimal in time and distortion, this algorithm appears to be the first that constructs an $O(n)$-size skeleton without requiring unbounded length messages or time proportional to the diameter of the network. Our second result is a new class of efficiently constructible $(α, β)$-spanners called Fibonacci spanners whose distortion improves with the distance being approximated. At their sparsest Fibonacci spanners can have nearly linear size, namely $O(n(\log \log n)^ϕ)$ , where $ϕ= (1 + \sqrt{5})/2$ is the golden ratio. As the distance increases the multiplicative distortion of a Fibonacci spanner passes through four discrete stages, moving from logarithmic to log-log arithmic, then into a period where it is constant, tending to 3, followed by another period tending to 1. On the lower bound side we prove that many recent sequential spanner constructions have no efficient counterparts in distributed networks, even if the desired distortion only needs to be achieved on the average or for a tiny fraction of the vertices. In particular, any distance preservers, purely additive spanners, or spanners with sublinear additive distortion must either be very dense, slow to construct, or have very weak guarantees on distortion.