On the equal-subset-sum problem

G.J. Woeginger, Zhongliang Yu

    Research output: Contribution to journalArticleAcademicpeer-review

    48 Citations (Scopus)


    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 languageEnglish
    Pages (from-to)299-302
    JournalInformation Processing Letters
    Issue number6
    Publication statusPublished - 1992


    Dive into the research topics of 'On the equal-subset-sum problem'. Together they form a unique fingerprint.

    Cite this