Sharat Ibrahimpur

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 24

Top Topics

Approximation Algorithms

Minimizing Makespan

Top Venues

Publications

Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur
Approximation algorithms for flexible graph connectivity. Math. Program. 204 (1) (2024)
Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur
Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions. Algorithmica 86 (8) (2024)
Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang
Efficient Caching with Reserves via Marking. CoRR (2023)
Ishan Bansal, Joe Cheriyan, Logan Grout, Sharat Ibrahimpur
Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals. APPROX/RANDOM (2023)
Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang
Efficient Caching with Reserves via Marking. ICALP (2023)
Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur
Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions. ICALP (2023)
Ishan Bansal, Joe Cheriyan, Logan Grout, Sharat Ibrahimpur
Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals. CoRR (2022)
Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang
Caching with Reserves. APPROX/RANDOM (2022)
Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang
Caching with Reserves. CoRR (2022)
Sharat Ibrahimpur, Chaitanya Swamy
A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing. SOSA (2022)
Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur
Approximating (p, 2) flexible graph connectivity via the primal-dual method. CoRR (2022)
Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. SIAM J. Discret. Math. 36 (3) (2022)
Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur
Extensions of the (p, q)-Flexible-Graph-Connectivity model. CoRR (2022)
Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur
Approximation Algorithms for Flexible Graph Connectivity. CoRR (2022)
Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur
Approximation Algorithms for Flexible Graph Connectivity. FSTTCS (2021)
Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur
A 2-Approximation Algorithm for Flexible Graph Connectivity. CoRR (2021)
Sharat Ibrahimpur, Chaitanya Swamy
Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan. ICALP (2021)
Sharat Ibrahimpur, Chaitanya Swamy
A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing. CoRR (2021)
Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. CoRR (2020)
Sharat Ibrahimpur, Chaitanya Swamy
Approximation Algorithms for Stochastic Minimum-Norm Combinatorial Optimization. FOCS (2020)
Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. APPROX-RANDOM (2020)
Sharat Ibrahimpur, Chaitanya Swamy
Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization. CoRR (2020)
Sharat Ibrahimpur, Chaitanya Swamy
Min-Max Theorems for Packing and Covering Odd (u, v)-trails. CoRR (2017)
Sharat Ibrahimpur, Chaitanya Swamy
Min-Max Theorems for Packing and Covering Odd (u, v)-trails. IPCO (2017)