Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Rhea Jain
Observed name:
Jain, Rhea
Institution:
University of Illinois Urbana-Champaign
Observed institution:
University of Illinois Urbana-Champaign
ORCID:
0009-0007-7913-8561
Observed ORCID:
0009-0007-7913-8561
OpenAlex ID:
A5017370583
Augmentation based Approximation Algorithms for Flexible Network Design
2022
·
Chekuri, Chandra
, Jain, Rhea
·
arXiv (Cornell University)
·
8
PDF
Approximation algorithms for network design in non-uniform fault models
2025
·
Chandra Chekuri
, Rhea Jain
·
Mathematical Programming
·
7
PDF
A Polylogarithmic Approximation for Directed Steiner Forest in Planar Digraphs
2025
·
Chandra Chekuri
, Rhea Jain
·
Society for Industrial and Applied Mathematics eBooks
·
5
PDF
From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs
2024
·
Chekuri, Chandra
, Jain, Rhea
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
5
PDF
Approximating Flexible Graph Connectivity via Räcke Tree based Rounding
2022
·
Chekuri, Chandra
, Jain, Rhea
·
arXiv (Cornell University)
·
5
PDF
Approximation Algorithms for Network Design in Non-Uniform Fault Models
2024
·
Chekuri, Chandra
, Jain, Rhea
·
arXiv (Cornell University)
·
4
PDF
A Polylogarithmic Approximation for Buy-at-Bulk Network Design with Protection
2026
·
Chandra Chekuri
, Rhea Jain
·
ACM Symposium on Theory of Computing (STOC)
·
3
Approximation Algorithms for Hop Constrained and Buy-At-Bulk Network Design via Hop Constrained Oblivious Routing
2024
·
Chekuri, Chandra
, Jain, Rhea
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
3
PDF
Node-Weighted Multicut in Planar Digraphs
2026
·
Chekuri, Chandra
, Jain, Rhea
·
arXiv (Cornell University)
·
1
PDF
A Little Length Slack Goes a Long Way in Planar Length-Constrained Network Design
2026
·
Hershkowitz, D Ellis
, Huang, Richard Z
, et al.
·
arXiv (Cornell University)
PDF
Length-Constrained Network Design in Planar Digraphs
2026
·
Chekuri, Chandra
, Jain, Rhea
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
PDF
Exponential Time Approximation for Coloring 3-Colorable Graphs
2024
·
Guruswami, Venkatesan
, Jain, Rhea
·
arXiv (Cornell University)
PDF
Show more works
View as search
Works count:
12
Citation count:
40
H-index:
5
I10-index:
Year
Topic
Type