1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.DS2026
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…
cs.DS2024
Exponential Time Approximation for Coloring 3-Colorable Graphs
Venkatesan Guruswami, Rhea Jain
The problem of efficiently coloring -colorable graphs with few colors has received much attention on both the algorithmic and inapproximability fronts. We consider exponential t…
cs.DS2024★ 1 cited
Approximation Algorithms for Network Design in Non-Uniform Fault Models
Chandra Chekuri, Rhea Jain
The Survivable Network Design problem (SNDP) is a well-studied problem, motivated by the design of networks that are robust to faults under the assumption that any subset of edges…