Optimal Vertex Fault Tolerant Spanners (for fixed stretch)
SODA '18: Symposium on Discrete Algorithms New Orleans Louisiana January, 2018, pp. 1884-1900, 2018.
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 ⊆ G is an f vertex fault tolerant (VFT) k-spanner if H \ F is a k-spanner of G \ F for any small set F of f vertices that might "fail." On...More
Full Text (Upload PDF)
PPT (Upload PPT)