Michal Dory

activity

20172026

most citedHardness of Distributed Optimization

2 citations · 4 across the 12 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

cs.DS2018★ 1 cited

Distributed Approximation of Minimum $k$ -edge-connected Spanning Subgraphs

Michal Dory

In the minimum $k$ -edge-connected spanning subgraph ( $k$ -ECSS) problem the goal is to find the minimum weight subgraph resistant to up to $k - 1$ edge failures. This is a central pro…

cs.DS2018

Distributed Spanner Approximation

Keren Censor-Hillel, Michal Dory

We address the fundamental network design problem of constructing approximate minimum spanners. Our contributions are for the distributed setting, providing both algorithmic and ha…

Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs

Distributed Spanner Approximation

Distributed Approximation of Minimum $k$ -edge-connected Spanning Subgraphs