Reliable Spanners for Metric Spaces

07/17/2020
by   Sariel Har-Peled, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/03/2019

Sometimes Reliable Spanners of Almost Linear Size

Reliable spanners can withstand huge failures, even when a linear number...
research
01/05/2022

Sparsifying Disk Intersection Graphs for Reliable Connectivity

The intersection graph induced by a set of n disks can be dense. It is ...
research
01/19/2021

Reliable Spanners: Locality-Sensitive Orderings Strike Back

Chan, Har-Peled, and Jones [2020] recently developed locality-sensitive ...
research
07/31/2023

Light, Reliable Spanners

A ν-reliable spanner of a metric space (X,d), is a (dominating) graph H,...
research
11/16/2018

A Spanner for the Day After

We show how to construct (1+ε)-spanner over a set P of n points in R^d t...
research
06/29/2021

Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions

Seminal works on light spanners over the years provide spanners with opt...
research
08/24/2020

A Unified and Fine-Grained Approach for Light Spanners

Seminal works on light spanners from recent years provide near-optimal t...

Please sign up or login with your details

Forgot password? Click here to reset