Author:
Chan T-H. Hubert,Chen Fei,Jiang Shaofeng H.-C.
Publisher
Society for Industrial and Applied Mathematics
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Online Ordinal Problems: Optimality of Comparison-based Algorithms and their Cardinal Complexity;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Knapsack Secretary Through Boosting;Approximation and Online Algorithms;2022
3. Secretaries with Advice;Proceedings of the 22nd ACM Conference on Economics and Computation;2021-07-18
4. Strong Algorithms for the Ordinal Matroid Secretary Problem;Mathematics of Operations Research;2021-02-23
5. Improved Online Algorithms for Knapsack and GAP in the Random Order Model;Algorithmica;2021-02-17