Abstract
Given a set S of n integers, the problem is to decide whether there exist two disjoint nonempty subsets S1,S2S whose elements sum up to the same value. We show this problem to be NP-complete and we present an approximation algorithm with worst-case ratio 1.324 for the optimization version of this problem.
Original language | English |
---|---|
Pages (from-to) | 299-302 |
Journal | Information Processing Letters |
Volume | 42 |
Issue number | 6 |
DOIs | |
Publication status | Published - 1992 |