Improved Purely Additive Fault-Tolerant Spanners
Let G be an unweighted n-node undirected graph. A β-additive spanner of G is a spanning subgraph H of G such that distances in H are stretched at most by an additive term β w.r.t. the corresponding distances in G. A natural research goal related with spanners is that of designing sparse spanners with low stretch.
In this paper, we focus on fault-tolerant additive spanners, namely additive spanners which are able to preserve their additive stretch even when one edge fails. We are able to improve all known such spanners, in terms of either sparsity or stretch. In particular, we consider the sparsest known spanners with stretch 6, 28, and 38, and reduce the stretch to 4, 10, and 14, respectively (while keeping the same sparsity).
Our results are based on two different constructions. On one hand, we show how to augment (by adding a small number of edges) a fault-tolerant additive sourcewise spanner (that approximately preserves distances only from a given set of source nodes) into one such spanner that preserves all pairwise distances. On the other hand, we show how to augment some known fault-tolerant additive spanners, based on clustering techniques. This way we decrease the additive stretch without any asymptotic increase in their size. We also obtain improved fault-tolerant additive spanners for the case of one vertex failure, and for the case of f edge failures.
KeywordsShort Path White Vertex Span Subgraph Additive Distortion Edge Failure
Unable to display preview. Download preview PDF.
- 6.Bernstein, A., Karger, D.R.: A nearly optimal oracle for avoiding failed vertices and edges. In: STOC, pp. 101–110 (2009)Google Scholar
- 7.Bilò, D., Gualà, L., Leucci, S., Proietti, G.: Fault-tolerant approximate shortest-path trees. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 137–148. Springer, Heidelberg (2014)Google Scholar
- 9.Chechik, S.: New additive spanners. In: SODA, pp. 498–512 (2013)Google Scholar
- 10.Chechik, S., Langberg, M., Peleg, D., Roditty, L.: Fault-tolerant spanners for general graphs. In: STOC, pp. 435–444 (2009)Google Scholar
- 13.Cygan, M., Grandoni, F., Kavitha, T.: On pairwise spanners. In: STACS, pp. 209–220 (2013)Google Scholar
- 14.Dinitz, M., Krauthgamer, R.: Fault-tolerant spanners: better and simpler. In: PODC, pp. 169–178 (2011)Google Scholar
- 15.Erdős, P.: Extremal problems in graph theory. In: Theory of Graphs and its Applications, pp. 29–36 (1964)Google Scholar
- 16.Grandoni, F., Williams, V.V.: Improved distance sensitivity oracles via fast single-source replacement paths. In: FOCS, pp. 748–757 (2012)Google Scholar
- 17.Parter, M.: Vertex fault tolerant additive spanners. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 167–181. Springer, Heidelberg (2014)Google Scholar
- 19.Parter, M., Peleg, D.: Fault tolerant approximate BFS structures. In: SODA, pp. 1073–1092 (2014)Google Scholar