Sometimes reliable spanners of almost linear size

DOI10.20382/JOCG.V13I1A6MaRDI QIDQ5077657zbMATH OpenFDO

Authors Kevin Buchin, Dániel Oláh, Sariel Har-Peled

Publication date 18 May 2022

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

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)

Recommendations

• A spanner for the day after
• Fault-tolerant geometric spanners
• Fault tolerant spanners for general graphs
• Fault-tolerant geometric spanners

Cited in

(8)

• A spanner for the day after
• A spanner for the day after
• Small Stretch Pairwise Spanners
• Locality-sensitive orderings and applications to reliable spanners
• Constructing red-black spanners for mixed-charging vehicular networks
• Near optimal locality sensitive orderings in Euclidean space
• Light, reliable spanners
• Stable roommates spanner

This page was built for publication: Sometimes reliable spanners of almost linear size

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