An Efficient Approximation Scheme for the Subset-Sum Problem

Authors:
Hans Kellerer;Ulrich Pferschy;Maria Grazia Speranza
Affiliations:
-;-;-
Venue:
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Year:
1997

Citing 0
Cited 3

Efficient approximation algorithms for the subset-sums equality problem

Journal of Computer and System Sciences
On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
An efficient fully polynomial approximation scheme for the Subset-Sum problem

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract