|
 | Up a level |
Bansal, Ishan, Cheriyan, Joseph, Grout, Logan and Ibrahimpur, Sharat (2024) Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions. Algorithmica, 86 (8). 2575 - 2604. ISSN 0178-4617
Bansal, Ishan, Cheriyan, Joe, Grout, Logan and Ibrahimpur, Sharat (2023) Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals. In: Megow, Nicole and Smith, Adam, (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959772969
Ibrahimpur, Sharat, Purohit, Manish, Svitkina, Zoya, Vee, Erik and Wang, Joshua R. (2023) Efficient caching with reserves via marking. In: Etessami, Kousha, Feige, Uriel and Puppis, Gabriele, (eds.) 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959772785
Bansal, Ishan, Cheriyan, Joseph, Grout, Logan and Ibrahimpur, Sharat (2023) Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions. In: Etessami, Kousha, Feige, Uriel and Puppis, Gabriele, (eds.) 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959772785
Boyd, Sylvia, Cheriyan, Joseph, Haddadan, Arash and Ibrahimpur, Sharat (2023) Approximation algorithms for flexible graph connectivity. Mathematical Programming. ISSN 0025-5610
