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.
|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|
|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
|Name||Leibniz International Proceedings in Informatics, LIPIcs|
|Conference||37th International Symposium on Computational Geometry, SoCG 2021|
|Period||7/06/21 → 11/06/21|
Bibliographical noteFunding Information:
Funding Sariel Har-Peled: Work on this paper was partially supported by a NSF AF award CCF-1907400. Manor Mendel: Supported by BSF Grant no. 2018223. Dániel Oláh: Supported by the Netherlands Organisation for Scientific Research (NWO) through Gravitation-grant NETWORKS-024.002.003.
© 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).