Robust geometric spanners

Prosenjit Bose, Vida Dujmović, Pat Morin, Michiel Smid
2013 Proceedings of the 29th annual symposium on Symposuim on computational geometry - SoCG '13  
Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable, and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in addition, geometric spanners. We define a property of spanners called robustness. Informally, when one removes a few vertices from a robust spanner, this harms only a small number of other vertices. We show that robust spanners must have a superlinear number of
more » ... dges, even in one dimension. On the positive side, we give constructions, for any dimension, of robust spanners with a near-linear number of edges.
doi:10.1145/2462356.2462381 dblp:conf/compgeom/BoseDMS13 fatcat:g6jmxnr3q5arrnp7ii4c3b6x54