No. Title Author Year
1 Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs Sun, Enze et al. 2023
2 On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching Liang, Jingxun et al. 2023
3 Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity Liao, Chao et al. 2022
4 Minimizing the Maximum Flow Time in the Online Food Delivery Problem Guo, Xiangyu et al. 2022
5 Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs Chan, Chun-Hsiang et al. 2020
6 Online Makespan Minimization: The Power of Restart Huang, Zhiyi et al. 2018
7 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: 7

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI