On the Complexity of Variations of Equal Sum Subsets

@article{Cieliebak2008OnTC,
  title={On the Complexity of Variations of Equal Sum Subsets},
  author={Mark Cieliebak and Stephan Eidenbenz and Aris Pagourtzis and Konrad Schlude},
  journal={Nord. J. Comput.},
  year={2008},
  volume={14},
  pages={151-172}
}
The Equal Sum Subsets problem, where we are given a set of positive integers and we ask for two nonempty disjoint subsets such that their elements add up to the same total, is known to be NP-hard. In this paper we give (pseudo-)polynomial algorithms and/or (strong) NP-hardness proofs for several natural variations of Equal Sum Subsets. Among others we present (1) a framework for obtaining NP-hardness proofs and pseudopolynomial time algorithms for Equal Sum Subsets variations, which we apply to… CONTINUE READING

Similar Papers

Loading similar papers…