1. Abboud, A., Cohen-Addad, V., Lee, E., Manurangsi, P.: Improved approximation algorithms and lower bounds for search-diversification problems. In: 49th International Colloquium on Automata, Languages, and Programming (ICALP), vol. 229, pp. 7:1–7:18 (2022). https://doi.org/10.4230/LIPIcs.ICALP.2022.7
2. Albers, S., Khan, A., Ladewig, L.: Improved online algorithms for knapsack and GAP in the random order model. Algorithmica 83(6), 1750–1785 (2021)
3. Anegg, G., Angelidakis, H., Kurpisz, A., Zenklusen, R.: A technique for obtaining true approximations for k-center with covering constraints. In: Bienstock, D., Zambelli, G. (eds.) Integer Programming and Combinatorial Optimization, pp. 52–65 (2020)
4. Awerbuch, B., Azar, Y., Grove, E.F., Kao, M., Krishnan, P., Vitter, J.S.: Load balancing in the $$l_p$$ norm. In: 36th Annual Symposium on Foundations of Computer Science (FOCS), pp. 383–391. IEEE Computer Society (1995)
5. Bandyapadhyay, S., Inamdar, T., Pai, S., Varadarajan, K.R.: A constant approximation for colorful k-center. In: 27th Annual European Symposium on Algorithms (ESA), vol. 144, pp. 12:1–12:14 (2019)