2 citations · 2 across the 1 of their papers we have counts for
4 papers
Light Edge Fault Tolerant Graph Spanners
Greg Bodwin, Michael Dinitz, Ama Koranteng +1
There has recently been significant interest in fault tolerant spanners, which are spanners that still maintain their stretch guarantees after some nodes or edges fail. This work h…
Approximation Algorithms for Optimal Hopsets
Michael Dinitz, Ama Koranteng, Yasamin Nazari
For a given graph , a "hopset" with hopbound and stretch is a set of edges such that between every pair of vertices and , there is a path with at most hop…
Improved Approximations for Relative Survivable Network Design
Michael Dinitz, Ama Koranteng, Guy Kortsarz +1
One of the most important and well-studied settings for network design is edge-connectivity requirements. This encompasses uniform demands such as the Minimum -Edge-Connected Sp…
Relative Survivable Network Design
Michael Dinitz, Ama Koranteng, Guy Kortsarz
One of the most important and well-studied settings for network design is edge-connectivity requirements. This encompasses uniform demands such as the Minimum -Edge-Connected Sp…