4 citations · 4 across the 1 of their papers we have counts for
3 papers
cs.DS2017
Optimal Vertex Fault Tolerant Spanners (for fixed stretch)
Greg Bodwin, Michael Dinitz, Merav Parter +1
A -spanner of a graph is a sparse subgraph whose shortest path distances match those of up to a multiplicative error . In this paper we study spanners that are re…
cs.GT2017
Testing Core Membership in Public Goods Economies
Greg Bodwin
This paper develops a recent line of economic theory seeking to understand public goods economies using methods of topological analysis. Our first main result is a very clean chara…
cs.DS2017★ 4 cited
Preserving Distances in Very Faulty Graphs
Greg Bodwin, Fabrizio Grandoni, Merav Parter +1
Preservers and additive spanners are sparse (hence cheap to store) subgraphs that preserve the distances between given pairs of nodes exactly or with some small additive error, res…