activity
20132021
most citedRobust Assignments via Ear Decompositions and Randomized Rounding

5 citations · 14 across the 6 of their papers we have counts for

collaborators
Showing 2019Show all

1 paper · 1 filter

cs.DS2019★ 1 cited

Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity

David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler

Graph connectivity and network design problems are among the most fundamental problems in combinatorial optimization. The minimum spanning tree problem, the two edge-connected span…