29 citations · 45 across the 10 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DS2020
Optimal Vertex Fault-Tolerant Spanners in Polynomial Time
Greg Bodwin, Michael Dinitz, Caleb Robelle
Recent work has pinned down the existentially optimal size bounds for vertex fault-tolerant spanners: for any positive integer , every -node graph has a -spanner on $…
cs.DS2020
Efficient and Simple Algorithms for Fault Tolerant Spanners
Michael Dinitz, Caleb Robelle
It was recently shown that a version of the greedy algorithm gives a construction of fault-tolerant spanners that is size-optimal, at least for vertex faults. However, the algorith…
cs.DS2020★ 1 cited
Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks
Michael Dinitz, Benjamin Moseley
New optical technologies offer the ability to reconfigure network topologies dynamically, rather than setting them once and for all. This is true in both optical wide area networks…