On the Complexity of Variations of Equal Sum Subsets

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 (i) a framework for obtaining NP-hardness proofs and pseudopolynomial time algorithms for EQUAL SUM SUBSETS variations, which we apply to variants of the problem with additional selection restrictions, (ii) a proof of NP-hardness and a pseudo-polynomial time algorithm for the case where we ask for two subsets such that the ratio of their sums is some fixed rational r > 0, (iii) a pseudo-polynomial time algorithm for finding k subsets of equal sum, with k = O(1), and a proof of strong NP-hardness for the same problem with k = Ω(n), (iv) algorithms and hardness results for finding k equal sum subsets under the additional requirement that the subsets should be of equal cardinality. Our results are a step towards determining the dividing lines between polynomial time solvability, pseudo-polynomial time solvability, and strong NP-completeness of subset-sum related problems.

[1]  Pavel A. Pevzner,et al.  Computational molecular biology : an algorithmic approach , 2000 .

[2]  Christos H. Papadimitriou,et al.  On Total Functions, Existence Theorems and Computational Complexity , 1991, Theor. Comput. Sci..

[3]  Mark Cieliebak,et al.  Algorithms and hardness results for DNA physical mapping, protein identification, and related combinatorial problems , 2003 .

[4]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[5]  Eugene L. Lawler,et al.  Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[6]  Stephan Eidenbenz,et al.  Equal sum subsets: Complexity of variations , 2002 .

[7]  Zsolt Tuza,et al.  Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem , 2002, J. Comput. Syst. Sci..

[8]  Christos H. Papadimitriou,et al.  On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  G. S. Lueker,et al.  Bin packing can be solved within 1 + ε in linear time , 1981 .

[11]  Deeparnab Chakrabarty,et al.  Knapsack Problems , 2008 .

[12]  Gerhard J. Woeginger,et al.  On the Equal-Subset-Sum Problem , 1992, Inf. Process. Lett..

[13]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[14]  Kirk Pruhs,et al.  Approximation schemes for a class of subset selection problems , 2007, Theor. Comput. Sci..

[15]  João Meidanis,et al.  Introduction to computational molecular biology , 1997 .

[16]  Sanjeev Khanna,et al.  A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem , 2005, SIAM J. Comput..

[17]  Paolo Penna,et al.  Noisy Data Make the Partial Digest Problem NP-hard , 2003, WABI.