Author:
Albers Susanne,Schubert Sebastian
Publisher
Springer International Publishing
Reference11 articles.
1. https://www.emarketer.com/content/worldwide-digital-ad-spending-year-end-update
2. Albers, S., Schubert, S.: Tight bounds for online matching in bounded-degree graphs with vertex capacities. In: Proceedings of 30th Annual European Symposium on Algorithms (ESA). LIPIcs, Leibniz International Proceedings in Informatics (2022). http://arxiv.org/abs/2206.15336
3. Azar, Y., Cohen, I., Roytman, A.: Online lower bounds via duality. In: Proceedings of 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1038–1050. SIAM (2017)
4. Lecture Notes in Computer Science;N Buchbinder,2007
5. Devanur, N., Hayes, T.: The adwords problem: online keyword matching with budgeted bidders under random permutations. In: Proceedings of 10th ACM Conference on Electronic Commerce (EC), pp. 71–78. ACM (2009)