No. |
Title |
Author |
Year |
1 |
A General Framework for Learning-Augmented Online Allocation |
Cohen, Ilan Reuven et al. |
2023 |
2 |
Efficient Algorithms and Hardness Results for the Weighted k-Server Problem |
Gupta, Anupam et al. |
2023 |
3 |
Online Paging with Heterogeneous Cache Slots |
Chrobak, Marek et al. |
2023 |
4 |
Sparsification of Directed Graphs via Cut Balance |
Cen, Ruoxu et al. |
2021 |
5 |
Universal Algorithms for Clustering Problems |
Ganesh, Arun et al. |
2021 |
6 |
Online Algorithms for Weighted Paging with Predictions |
Jiang, Zhihao et al. |
2020 |
7 |
Online Two-Dimensional Load Balancing |
Cohen, Ilan et al. |
2020 |
8 |
Robust Algorithms for TSP and Steiner Tree |
Ganesh, Arun et al. |
2020 |
9 |
Retracting Graphs to Cycles |
Haney, Samuel et al. |
2019 |
10 |
Faster Algorithms for the Geometric Transportation Problem |
Agarwal, Pankaj K. et al. |
2017 |
11 |
Profit Sharing and Efficiency in Utility Games |
Gollapudi, Sreenivas et al. |
2017 |
12 |
Symmetric Interdiction for Matching Problems |
Haney, Samuel et al. |
2017 |
13 |
Online Set Cover with Set Requests |
Bhawalkar, Kshipra et al. |
2014 |
14 |
The Semi-stochastic Ski-rental Problem |
Madry, Aleksander et al. |
2011 |