Abstract
Given a set ofn positive integers and another positive integerW, the Subset-Sum Problem is to find that subset whose sum is closest to, without exceeding,W. We present a polynomial approximation scheme for this problem and prove that its worst-case performance dominates that of Johnson's well-known scheme.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M.L. Fisher, “Worst-case analysis of heuristic algorithms,”Management Science 26 (1980) 1–17.
M.R. Garey and D.S. Johnson,Computers and intractability: a guide to the theory of NP-completeness (Freeman, San Francisco, 1979).
G.V. Gens and E.V. Levner, “Fast approximation algorithms for knapsack type problems,” in: K. Iracki, K. Malanowski and S. Walukiewicz, eds.,Optimization techniques, Part 2, Lecture Notes in Control and Information Sciences 23 (Springer, Berlin, 1980) pp. 185–194.
O.H. Ibarra and C.E. Kim, “Fast approximation algorithms for the knapsack and sum of subset problems,”Journal of the ACM 22 (1975) 463–468.
D.S. Johnson, “Approximation algorithms for combinatorial problems,”Journal of Computer and System Sciences 9 (1974) 256–278.
E. L. Lawler, “Fast approximation algorithms for knapsack problems,”Mathematics of Operations Research 4 (1979) 339–356.
S. Sahni, “Approximate algorithms for the 0/1 knapsack problem,”Journal of the ACM 22 (1975) 115–124.
Author information
Authors and Affiliations
Additional information
Research supported by Ministero Pubblica Istruzion, Italy.
Rights and permissions
About this article
Cite this article
Martello, S., Toth, P. Worst-case analysis of greedy algorithms for the subset-sum problem. Mathematical Programming 28, 198–205 (1984). https://doi.org/10.1007/BF02612360
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02612360