2 citations · 3 across the 3 of their papers we have counts for
4 papers
Node-Weighted Multicut in Planar Digraphs
Chandra Chekuri, Rhea Jain
Kawarabayashi and Sidiropoulos [KS22] obtained an -approximation algorithm for Multicut in planar digraphs via a natural LP relaxation, which also establishes a corres…
Streaming Algorithms for Network Design
Chandra Chekuri, Rhea Jain, Sepideh Mahabadi +1
We consider the Survivable Network Design problem (SNDP) in the single-pass insertion-only streaming model. The input to SNDP is an edge-weighted graph and an integer…
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…
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…