Publisher
Springer International Publishing
Reference34 articles.
1. Albers, S., Khan, A., Ladewig, L.: Improved online algorithms for knapsack and GAP in the random order model. Algorithmica, February 2021. https://doi.org/10.1007/s00453-021-00801-2
2. Albers, S., Ladewig, L.: New results for the k-secretary problem. Theor. Comput. Sci. 863, 102–119 (2021). https://doi.org/10.1016/j.tcs.2021.02.022
3. Babaioff, M., Hartline, J., Kleinberg, R.: Selling banner ads: Online algorithms with buyback. In: Fourth Workshop on Ad Auctions (2008)
4. Babaioff, M., Hartline, J.D., Kleinberg, R.D.: Selling ad campaigns: online algorithms with cancellations. In: Proceedings of the 10th ACM Conference on Electronic Commerce, pp. 61–70 (2009)
5. Lecture Notes in Computer Science;M Babaioff,2007
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献