Efficient and Simple Algorithms for Fault-Tolerant Spanners

DOI10.1145/3382734.3405735MaRDI QIDQ5854057zbMATH OpenOpenAlexFDO

Authors Michael Dinitz, Caleb Robelle

Publication date 15 March 2021

Published in Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2002.10889

zbMATH Keywords

fault-tolerancespanners

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• Improved algorithms for constructing fault-tolerant spanners
• scientific article; zbMATH DE number 1775403
• Fault-tolerant spanners for general graphs
• Fault tolerant spanners for general graphs
• A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners
• Fault-tolerant geometric spanners
• Fault-tolerant geometric spanners
• Optimal Vertex Fault Tolerant Spanners (for fixed stretch)
• Multipath spanners via fault-tolerant spanners
• Nearly optimal vertex fault-tolerant spanners in optimal time: sequential, distributed, and parallel

Cited in

(11)

• Fault-tolerant geometric spanners
• A fast algorithm for source-wise round-trip spanners
• Fault-tolerant spanners
• scientific article; zbMATH DE number 1775403 (Why is no real title available?)
• A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners
• Improved approximations for relative survivable network design
• Color fault-tolerant spanners
• Deterministic replacement path covering
• Restorable shortest path tiebreaking for edge-faulty graphs
• Light edge fault tolerant graph spanners
• Streaming algorithms for network design

This page was built for publication: Efficient and Simple Algorithms for Fault-Tolerant Spanners

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5854057)