Sharat Ibrahimpur

According to our database, Sharat Ibrahimpur authored at least 14 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions.

Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur

Algorithmica, August, 2024

Approximation algorithms for flexible graph connectivity.

Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur

Math. Program., March, 2024

2023

Efficient Caching with Reserves via Marking.

Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals.

Ishan Bansal, Joe Cheriyan, Logan Grout, Sharat Ibrahimpur

Proceedings of the Approximation, 2023

2022

A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case.

Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang

SIAM J. Discret. Math., September, 2022

Extensions of the (p, q)-Flexible-Graph-Connectivity model.

Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur

CoRR, 2022

Approximating (p, 2) flexible graph connectivity via the primal-dual method.

Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur

CoRR, 2022

A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing.

Sharat Ibrahimpur, Chaitanya Swamy

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Caching with Reserves.

Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang

Proceedings of the Approximation, 2022

2021

A 2-Approximation Algorithm for Flexible Graph Connectivity.

Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur

CoRR, 2021

Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan.

Sharat Ibrahimpur, Chaitanya Swamy

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Approximation Algorithms for Stochastic Minimum-Norm Combinatorial Optimization.

Sharat Ibrahimpur, Chaitanya Swamy

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case.

Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang

Proceedings of the Approximation, 2020

2017

Min-Max Theorems for Packing and Covering Odd (u, v)-trails.

Sharat Ibrahimpur, Chaitanya Swamy

Proceedings of the Integer Programming and Combinatorial Optimization, 2017