Minimum-norm load balancing is (almost) as easy as minimizing makespan S Ibrahimpur, C Swamy
48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021
15 2021 Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization S Ibrahimpur, C Swamy
IEEE 61st Annual Symposium on Foundations of Computer Science, 966-977, 2020
12 2020 Approximation algorithms for flexible graph connectivity S Boyd, J Cheriyan, A Haddadan, S Ibrahimpur
Mathematical Programming 204 (1), 493-516, 2024
11 2024 Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions I Bansal, J Cheriyan, L Grout, S Ibrahimpur
arXiv preprint arXiv:2209.11209, 2022
7 2022 Min-Max Theorems for Packing and Covering Odd (u , v )-trails S Ibrahimpur, C Swamy
International Conference on Integer Programming and Combinatorial …, 2017
6 * 2017 A -Approximation Algorithm for the Minimum -Edge Connected Multisubgraph Problem in the Half-Integral Case S Boyd, J Cheriyan, R Cummings, L Grout, S Ibrahimpur, Z Szigeti, ...
SIAM Journal on Discrete Mathematics 36 (3), 1730-1747, 2022
5 2022 Extensions of the -Flexible-Graph-Connectivity model I Bansal, J Cheriyan, L Grout, S Ibrahimpur
arXiv preprint arXiv:2211.09747, 2022
2 2022 Caching with reserves S Ibrahimpur, M Purohit, Z Svitkina, E Vee, J Wang
arXiv preprint arXiv:2207.05975, 2022
2 2022 Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals I Bansal, J Cheriyan, L Grout, S Ibrahimpur
arXiv preprint arXiv:2206.11807, 2022
2 2022 A simple approximation algorithm for vector scheduling and applications to stochastic min-norm load balancing S Ibrahimpur, C Swamy
Symposium on Simplicity in Algorithms (SOSA), 247-256, 2022
2 2022 Efficient caching with reserves via marking S Ibrahimpur, M Purohit, Z Svitkina, E Vee, JR Wang
arXiv preprint arXiv:2305.02508, 2023
1 2023 Stochastic minimum norm combinatorial optimization S Ibrahimpur
University of Waterloo, 2022
1 2022 Approximating (p, 2) flexible graph connectivity via the primal-dual method. I Bansal, J Cheriyan, L Grout, S Ibrahimpur
CoRR, 2022
2022 Packing and covering odd (u, v)-trails in a graph/by Sharat Ibrahimpur. S Ibrahimpur
University of Waterloo, Waterloo, Ontario, Canada, 2016
2016