No. |
Title |
Author |
Year |
---|

1 |
Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals |
Bansal, Ishan et al. |
2023 |

2 |
Efficient Caching with Reserves via Marking |
Ibrahimpur, Sharat et al. |
2023 |

3 |
Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions |
Bansal, Ishan et al. |
2023 |

4 |
Caching with Reserves |
Ibrahimpur, Sharat et al. |
2022 |

5 |
Approximation Algorithms for Flexible Graph Connectivity |
Boyd, Sylvia et al. |
2021 |

6 |
Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan |
Ibrahimpur, Sharat et al. |
2021 |

7 |
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case |
Boyd, Sylvia et al. |
2020 |