Abstract: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 t1, . . . , t k , determine whether there exist k disjoint subsets Z1, . . . , Z k ⊆ Z, such that Σ(Zi) = ti, for i = 1, . . . , k. Assuming t = max{t1, . . . , t k } is the maximum among the given targets, a standard dynamic programming approach based on Bellman's algorithm [3] can solve the problem in O(nt k ) time. We build upon recent advances on Subse… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.