1. Abshoff, S., Kling, P., Markarian, C., Meyerauf der Heide, F., Pietrzyk, P.: Towards the price of leasing online. J. Comb. Optim. 32(4), 1197–1216 (2016)
2. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.S.: The online set cover problem. SIAM J. Comput. 39(2), 361–370 (2009)
3. Alon, N., Azar, Y., Gutner, S.: Admission control to minimize rejections and online set cover with repetitions. In: Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 238–244 (2005)
4. Lecture Notes in Computer Science;BM Anthony,2007
5. Bhawalkar, K., Gollapudi, S., Panigrahi, D.: Online set cover with set requests. In: Klaus J., Rolim, J.D.P., Devanur, N.R., Moore, C. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014), vol. 28 of Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, pp. 64–79. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2014)