Author:
Buchbinder Niv,Feldman Moran,Ghosh Arpita,Naor Joseph
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference18 articles.
1. Abrams, Z., & Vee, E. (2007). Personalized ad delivery when ads fatigue: An approximation algorithm. In WINE ’07: Workshop on Internet and Network, Economics (pp. 535–540).
2. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., & Naor, J. (2006). A general approach to online network optimization problems. ACM Transactions on Algorithms, 2(4), 640–660.
3. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., & Naor, J. (2009). The online set cover problem. SIAM Journal on Computing, 39(2), 361–370.
4. Bansal, N., Chen, N., Cherniavsky, N., Rudra, A., Schieber, B., & Sviridenko, M. (2010). Dynamic pricing for impatient bidders. ACM Transactions on Algorithms, 6(2), 726–735.
5. Bansal, N., Buchbinder, N., & Naor, J. (2012a). A primal-dual randomized algorithm for weighted paging. Journal of the ACM, 59(4), 19.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献