Faster Algorithms for $k$-Subset Sum and Variations

Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis +1

We present new, faster pseudopolynomial time algorithms for the $k$-Subset Sum problem, defined as follows: given a set $Z$ of $n$ positive integers and $k$ targets $t_1, \ldots, t…