Abstract
A spanner is reliable if it can withstand large, catastrophic failures in the network. More precisely, any failure of some nodes can only cause a small damage in the remaining graph in terms of the dilation. In other words, the spanner property is maintained for almost all nodes in the residual graph. Constructions of reliable spanners of near linear size are known in the low-dimensional Euclidean settings. Here, we present new constructions of reliable spanners for planar graphs, trees, and (general) metric spaces.
Original language | English |
---|---|
Article number | 7 |
Pages (from-to) | 7:1-7:27 |
Number of pages | 27 |
Journal | ACM Transactions on Algorithms |
Volume | 19 |
Issue number | 1 |
DOIs | |
State | Published - 9 Mar 2023 |
Keywords
- Additional Key Words and PhrasesComputational geometry
- reliable
- spanners
All Science Journal Classification (ASJC) codes
- Mathematics (miscellaneous)