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

.

##
###
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees
[article]

2016
*
arXiv
*
pre-print

Let G be an n-node and m-edge positively real-weighted undirected graph. For any given integer f > 1, we study the problem of designing a sparse f-edge-fault-tolerant (f-EFT) σ -approximate single-source shortest-path tree (σ-ASPT), namely a subgraph of G having as few edges as possible and which, following the failure of a set F of at most f edges in G, contains paths from a fixed source that are stretched at most by a factor of σ. To this respect, we provide an algorithm that efficiently

arXiv:1601.04169v2
fatcat:l6ytznxbifaaxlneu6r4tpqpfy