1. Alon, T.: Fully polynomial time approximation schemes (FPTAS) for some counting problems. Master’s thesis. arXiv preprintarXiv:1611.00992 (2016)
2. Alon, T., Halman, N.: Automatic generation of FPTASes for stochastic monotone dynamic programs made easier. SIAM J. Discret. Math. 35, 2679–2722 (2021)
3. Bertsekas, D.: Dynamic programming and optimal control. Athena scientific Belmont, MA (1995)
4. Camponogara, E., Shima, R.B.: Mobile agent routing with time constraints: a resource constrained longest-path approach. J. Univ. Comput. Sci. 16(3), 372–401 (2010)
5. Chan, T.M.: Approximation schemes for 0–1 knapsack. In: Proceedings of the 1st Symposium of Simplicity in Algorithms (SOSA), pp. 5:1–5:12. (2018)