Author:
Feldman Jon,Korula Nitish,Mirrokni Vahab,Muthukrishnan S.,Pál Martin
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Alaei, S., Malekian, A.: Maximizing sequence-submodular functions (2009) (manuscript)
2. Azar, Y., Birnbaum, B., Karlin, A.R., Mathieu, C., Nguyen, C.T.: Improved Approximation Algorithms for Budgeted Allocations. In: Proc. Automata, Languages and Programming (2008)
3. Babaioff, M., Hartline, J., Kleinberg, R.: Selling ad campaigns: Online algorithms with cancellations. In: ACM EC (2009)
4. Lecture Notes in Computer Science;N. Buchbinder,2007
5. Buchbinder, N., Naor, J.: The Design of Competitive Online Algorithms via a Primal-Dual Approach. Foundations and Trends in Theoretical Computer Science 3(2-3), 93–263 (2007)
Cited by
103 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献