29 citations · 45 across the 9 of their papers we have counts for
1 paper · 1 filter
Greg Bodwin, Michael Dinitz, Merav Parter +1
A k-spanner of a graph G is a sparse subgraph H whose shortest path distances match those of G up to a multiplicative error k. In this paper we study spanners that are re…