Author:
Abolhassani Melika,Esfandiari Hossein,Nazari Yasamin,Sivan Balasubramanian,Teng Yifeng,Thomas Creighton
Publisher
Springer International Publishing
Reference32 articles.
1. Lecture Notes in Computer Science;G Aggarwal,2014
2. Aggarwal, G., Goel, G., Karande, C., Mehta, A.: Online vertex-weighted bipartite matching and single-bid budgeted allocations. In: Randall, D. (ed.) Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, 23–25 January 2011, pp. 1253–1264. SIAM (2011)
3. Agrawal, S., Devanur, N.R.: Fast algorithms for online stochastic convex programming. In: Indyk, P. (ed.) Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, 4–6 January 2015, pp. 1405–1424. SIAM (2015)
4. Agrawal, S., Wang, Z., Ye, Y.: A dynamic near-optimal algorithm for online linear programming. Oper. Res. 62(4), 876–890 (2014)
5. Balseiro, S.R., Feldman, J., Mirrokni, V.S., Muthukrishnan, S.: Yield optimization of display advertising with ad exchange. Manag. Sci. 60(12), 2886–2907 (2014)