1. Agarwal, P.K., Pan, J.: Near-linear algorithms for geometric hitting sets and set covers. Discret. Comput. Geom. 63(2), 460–482 (2020)
2. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem. SIAM J. Comput. 39(2), 361–370 (2009)
3. Argue, C.J., Gupta, A., Tang, Z., Guruganesh, G.: Chasing convex bodies with linear competitive ratio. J. ACM 68(5), 32:1-32:10 (2021)
4. Bienkowski, M., Byrka, J., Chrobak, M., Coester, C., Jez, L., Koutsoupias, E.: Better bounds for online line chasing. In: 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26–30, 2019, volume 138 of LIPIcs, pp. 8:1–8:13. Schloss Dagstuhl–Leibniz-Zentrum für Informatik (2019)
5. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (2005)