Abstract
Given a set S of n integers, the problem is to decide whether there exist two disjoint nonempty subsets S 1, S 2⊆ S 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
