Author:
Badanidiyuru Varadaraja Ashwinkumar
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Adler, R., Azar, Y.: Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms. In: SODA, pp. 1–10 (1999)
2. Lecture Notes in Computer Science;B.V. Ashwinkumar,2009
3. Azar, Y., Blum, A., Mansour, Y.: Combining online algorithms for rejection and acceptance. In: SPAA, pp. 159–163 (2003)
4. Babaioff, M., Hartline, J.D., Kleinberg, R.: Selling ad campaigns: online algorithms with buyback. In: EC (2009)
5. Lecture Notes in Computer Science;M. Babaioff,2007
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Prophet Inequalities with Cancellation Costs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. The Power of Subsampling in Submodular Maximization;Mathematics of Operations Research;2021-10-13
3. Online Budgeted Maximum Coverage;Algorithmica;2021-07-12
4. Online maximum matching with recourse;Journal of Combinatorial Optimization;2020-09-03
5. Fully Online Matching;Journal of the ACM;2020-06-30