A. Koranteng

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2025

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…

cs.DS2025

Approximation Algorithms for Optimal Hopsets

Michael Dinitz, Ama Koranteng, Yasamin Nazari

For a given graph $G$ , a "hopset" $H$ with hopbound $β$ and stretch $α$ is a set of edges such that between every pair of vertices $u$ and $v$ , there is a path with at most $β$ hop…

cs.DS2023

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 $k$ -Edge-Connected Sp…