Light Edge Fault Tolerant Graph Spanners
Greg Bodwin, Michael Dinitz, Ama Koranteng, Lily Wang

TL;DR
This paper studies light edge fault tolerant graph spanners, establishing bounds on their weight relative to fault-tolerant connectivity preservers, and introduces bicriteria notions to achieve reasonable lightness bounds.
Contribution
It introduces the first results on lightness bounds for fault-tolerant spanners in general graphs, especially under bicriteria relaxations, and determines the optimal tradeoff parameter f' = 2f.
Findings
Lightness can be unbounded when normalized by the traditional MST.
Normalizing by a fault-tolerant connectivity preserver provides better bounds.
Optimal lightness bounds are achieved when normalizing by a 2f-EFT connectivity preserver.
Abstract
There has recently been significant interest in fault tolerant spanners, which are spanners that still maintain their stretch guarantees after some nodes or edges fail. This work has culminated in an almost complete understanding of the three-way tradeoff between stretch, sparsity, and number of faults tolerated. However, despite some progress in metric settings, there have been no results to date on the tradeoff in general graphs between stretch, lightness, and number of faults tolerated. We initiate the study of light edge fault tolerant (EFT) graph spanners, obtaining the first such results. First, we observe that lightness can be unbounded if we use the traditional definition (normalizing by the MST). We then argue that a natural definition of fault-tolerant lightness is to instead normalize by a min-weight fault tolerant connectivity preserver; essentially, a fault-tolerant…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
