1. Ackerman, E., Ben-Zwi, O., Wolfovitz, G.: Combinatorial model and bounds for target set selection. Theor. Comp. Sci. 411(44–46), 4017–4022 (2010)
2. Arora, S., Lund, C.: Hardness of approximation. In: Hochbaum, Ed. D. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 399–446 PWS Publishers (1995)
3. Bandyapadhyay, S., Inamdar, T., Pai, S., Varadarajan, K.: A constant approximation for colorful k-center. arXiv:1907.08906v1 (2019)
4. Ben-Zwi, O., Hermelin, D., Lokshtanov, D., Newman, I.: Treewidth governs the complexity of target set selection. Discrete Optim. 8(1), 87–96 (2011)
5. Bonato, A.: A survey of graph burning. Contr. Discret. Math. 16, 185–197 (2021)