2 citations · 3 across the 10 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.DS2024
Improved Online Reachability Preservers
Greg Bodwin, Tuong Le
A reachability preserver is a basic kind of graph sparsifier, which preserves the reachability relation of an -node directed input graph among a set of given demand pairs $P…
cs.DS2024
Additive Spanner Lower Bounds with Optimal Inner Graph Structure
Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams +2
We construct -node graphs on which any -size spanner has additive error at least , improving on the previous best lower bound of [Bodwin-Hoppenw…
cs.DS2024
The Discrepancy of Shortest Paths
Greg Bodwin, Chengyuan Deng, Jie Gao +3
The hereditary discrepancy of a set system is a certain quantitative measure of the pseudorandom properties of the system. Roughly, hereditary discrepancy measures how well one can…