| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity | Liao, Chao et al. | 2022 |
| 2 | Minimizing the Maximum Flow Time in the Online Food Delivery Problem | Guo, Xiangyu et al. | 2022 |
| 3 | Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs | Chan, Chun-Hsiang et al. | 2020 |
| 4 | Online Makespan Minimization: The Power of Restart | Huang, Zhiyi et al. | 2018 |
| 5 | Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals | Huang, Zhiyi et al. | 2018 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 5 |