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, that is, 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 |
---|---|
Title of host publication | 37th International Symposium on Computational Geometry, SoCG 2021 |
Editors | Kevin Buchin, Eric Colin de Verdiere |
Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
ISBN (Electronic) | 9783959771849 |
DOIs | |
State | Published - 1 Jun 2021 |
Event | 37th International Symposium on Computational Geometry, SoCG 2021 - Virtual, Buffalo, United States Duration: 7 Jun 2021 → 11 Jun 2021 |
Publication series
Name | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|
Volume | 189 |
ISSN (Print) | 1868-8969 |
Conference
Conference | 37th International Symposium on Computational Geometry, SoCG 2021 |
---|---|
Country/Territory | United States |
City | Virtual, Buffalo |
Period | 7/06/21 → 11/06/21 |
Bibliographical note
Publisher Copyright:© Sariel Har-Peled, Manor Mendel, and Dániel Oláh; licensed under Creative Commons License CC-BY 4.0 37th International Symposium on Computational Geometry (SoCG 2021).
Keywords
- Reliability
- Spanners