Abstract
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close as possible. In two versions of this problem, the quality of a solution is measured by the ratio and the difference of the two partial sums, respectively.
Answering a problem of Woeginger and Yu (1992) in the affirmative, we give a fully polynomial-time approximation scheme for the case where the value to be optimized is the ratio between the sums of the numbers in the two sets. On the other hand, we show that in the case where the value of a solution is the positive difference between the two partial sums, the problem is not 2n k -approximable in polynomial time unless P=NP, for any constant k. In the positive direction, we give a polynomial-time algorithm that finds two subsets for which the difference of the two sums does not exceed K/n Ω(log n) where K is the greatest number in the instance.
This research was supported by the ESPRIT Working Group RAND2 nℴ 21726 and by the bilateral project Balaton, grant numbers 97140 (APAPE, France) and F-36/96 (TéT Alapítvány, Hungary)
Preview
Unable to display preview. Download preview PDF.
References
C. Bazgan, M. Santha and Zs. Tuza, On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs, 15th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 1373 (1998), 276–286.
O. H. Ibarra and C. E. Kim, Fast approximation algorithms for the Knapsack and Sum of Subset problems, J. ACM, 22:4 (1975), 463–468.
R. M. Karp, Reducibility among combinatorial problems, in: Complexity of Computer Computations (R. E. Miller and J. W. Thatcher, eds.) (1972), 85–103.
H. Kellerer, R. Mansini, U. Pferschy and M. G. Speranza, An efficient fully polynomial approximation scheme for the Subset-Sum problem, manuscript, 1997.
N. Megiddo and C. Papadimitriou, On total functions, existence theorems and computational complexity, Theoretical Computer Science, 81 (1991), 317–324.
C. Papadimitriou, On the complexity of the parity argument and other inefficient proofs of existence, Journal of Computer and System Sciences 48 (1994), 498–532.
G. J. Woeginger and Z. Yu, On the equal-subset-sum problem, Information Processing Letters 42 (1992), 299–302.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bazgan, C., Santha, M., Tuza, Z. (1998). Efficient approximation algorithms for the subset-sums equality problem. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055069
Download citation
DOI: https://doi.org/10.1007/BFb0055069
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64781-2
Online ISBN: 978-3-540-68681-1
eBook Packages: Springer Book Archive