# Optimal Vertex Fault Tolerant Spanners (for fixed stretch)

@article{Bodwin2017OptimalVF,
title={Optimal Vertex Fault Tolerant Spanners (for fixed stretch)},
author={Gregory Bodwin and Michael Dinitz and Merav Parter and Virginia Vassilevska Williams},
journal={ArXiv},
year={2017},
volume={abs/1710.03164}
}
• Published 9 October 2017
• Mathematics, Computer Science
• ArXiv
A $k$-spanner of a graph $G$ is a sparse subgraph $H$ whose shortest path distances match those of $G$ up to a multiplicative error $k$. In this paper we study spanners that are resistant to faults. A subgraph $H \subseteq G$ is an $f$ vertex fault tolerant (VFT) $k$-spanner if $H \setminus F$ is a $k$-spanner of $G \setminus F$ for any small set $F$ of $f$ vertices that might "fail." One of the main questions in the area is: what is the minimum size of an $f$ fault tolerant $k$-spanner that…
24 Citations

## Figures from this paper

• Mathematics
SODA
• 2021

### Fault-tolerant spanners for general graphs

• Computer Science, Mathematics
STOC '09
• 2009
An f-vertex fault tolerant (2k-1)-spanner of size O(f <sup>2</sup> k<sup>f+1</Sup> · n<sup><sup>1+1/k</sup>) (only f times larger than standard spanners) is presented.

### Improved Algorithms for Constructing Fault-Tolerant Spanners

• Computer Science, Mathematics
Algorithmica
• 2001
Algorithms are given that construct k -fault-tolerant spanners for S, a set of n points in a metric space, whose total edge length is O(ck) times the weight of a minimum spanning tree of S, for some constant c .

### Connectivity Oracles for Graphs Subject to Vertex Failures

• Computer Science
SODA
• 2017
This is the first connectivity oracle for general graphs that can efficiently deal with an unbounded number of vertex failures and also develops a more efficient Monte Carlo edge-failure connectivity oracles.

### Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming

• Computer Science, Mathematics
Discret. Math. Algorithms Appl.
• 2010
This paper shows how to compute efficiently (3,2)- and (2,1)- spanners of G, using only very small internal memory and a slow access external memory device, which have asymptotically optimal size and the I/O complexity of their algorithms is optimal up to a polylogarithmic factor.

### Efficient algorithms for constructing fault-tolerant geometric spanners

• Mathematics, Computer Science
STOC '98
• 1998
This paper presents an algorithm with running time O(n logdB1 n + kn log log n + k2n) that constructs a spanner with O(k2n), whose total edge length is bounded by G(2) times the weight of a miuimum spanning tree of S, and that is resilient to k edge or vertex faults.

### New Results of Fault Tolerant Geometric Spanners

A construction of a k-vertex fault tolerant spanner with O(kn) edges which is a tight bound and a more natural but stronger definition of k-edge fault tolerance which not necessarily can be satisfied if one allows only simple edges between the points of S.