Ibrahimpur, Sharat

Number of items: 4.
Article
  • Bansal, Ishan, Cheriyan, Joseph, Grout, Logan, Ibrahimpur, Sharat (2024). Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions. Algorithmica, 86(8), 2575 - 2604. https://doi.org/10.1007/s00453-024-01235-2 picture_as_pdf
    • Chapter
  • Bansal, Ishan, Cheriyan, Joe, Grout, Logan, Ibrahimpur, Sharat (2023). Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals. In Megow, N. & Smith, A. (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023 . Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.14 picture_as_pdf
  • Ibrahimpur, Sharat, Purohit, Manish, Svitkina, Zoya, Vee, Erik, Wang, Joshua R. (2023). Efficient caching with reserves via marking. In Etessami, K., Feige, U. & Puppis, G. (Eds.), 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023 . Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2023.80 picture_as_pdf
  • Bansal, Ishan, Cheriyan, Joseph, Grout, Logan, Ibrahimpur, Sharat (2023). Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions. In Etessami, K., Feige, U. & Puppis, G. (Eds.), 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023 . Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2023.15 picture_as_pdf