A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Optimal Vertex Fault Tolerant Spanners (for fixed stretch)
[chapter]

2018
*
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
*

greedy algorithm used to build spanners in the non-faulty setting. We also consider the edge fault tolerant (EFT) model, defined analogously with edge failures rather than vertex failures. We show that the same spanner upper bound applies in this setting. Our data structure lower bound extends to the case k = 2 (and hence we close the EFT problem for 3-approximations), but it falls to Ω(f 1/2−1/(2k) · n 1+1/k ) for k ≥ 3. We leave it as an open problem to close this gap. Introduction A spanner

doi:10.1137/1.9781611975031.123
dblp:conf/soda/BodwinDPW18
fatcat:t5sr4ib7freujfdjufj4sidzqe