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 |
Bibliographical note
Publisher Copyright:© 2023 Association for Computing Machinery.
DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.
Keywords
- Additional Key Words and PhrasesComputational geometry
- reliable
- spanners