2 citations · 4 across the 7 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022★ 1 cited
Approximating Flexible Graph Connectivity via Räcke Tree based Rounding
Chandra Chekuri, Rhea Jain
Flexible graph connectivity is a new network design model introduced by Adjiashvili. It has seen several recent algorithmic advances. Despite these, the approximability even in the…
cs.DS2022★ 2 cited
Augmentation based Approximation Algorithms for Flexible Network Design
Chandra Chekuri, Rhea Jain
Adjiashvili introduced network design in a non-uniform fault model: the edge set of a given graph is partitioned into safe and unsafe edges. A vertex pair is -flex-c…