1. Bazgan, C., Santha, M., Tuza, Z.: Efficient approximation algorithms for the subset-sums equality problem. J. Comput. Syst. Sci. 64(2), 160–170 (2002). https://doi.org/10.1006/jcss.2001.1784
2. Chan, T.M.: Approximation schemes for 0-1 knapsack. In: SOSA 2018, pp. 5:1–5:12 (2018)
3. Lecture Notes in Computer Science;M Cieliebak,2004
4. Lecture Notes in Computer Science;M Cieliebak,2003
5. Cieliebak, M., Eidenbenz, S., Pagourtzis, A., Schlude, K.: Equal sum subsets: complexity of variations. Technical report 370. ETH Zürich, Department of Computer Science (2003)