1. Agrawal, A., Jain, P., Kanesh, L., Misra, P., Saurabh, S.: Exploring the kernelization borders for hitting cycles. In: 13th International Symposium on Parameterized and Exact Computation, IPEC, pp. 14:1–14:14 (2018)
2. Arkin, E.M., Halldórsson, M.M., Hassin, R.: Approximating the tree and tour covers of a graph. IPL 47(6), 275–282 (1993)
3. Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math. 12(3), 289–297 (1999)
4. Becker, A., Geiger, D.: Optimization of pearl’s method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem. Artif. Intell. 83(1), 167–188 (1996)
5. van Bevern, R., Fluschnik, T., Tsidulko, O.Y.: On approximate data reduction for the rural postman problem: theory and experiments. arXiv preprint arXiv:1812.10131 (2018)