{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:42:31Z","timestamp":1772044951629,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0022-0000(03)00006-0","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T23:27:29Z","timestamp":1051745249000},"page":"349-370","source":"Crossref","is-referenced-by-count":56,"title":["An efficient fully polynomial approximation scheme for the Subset-Sum Problem"],"prefix":"10.1016","volume":"66","author":[{"given":"Hans","family":"Kellerer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renata","family":"Mansini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Grazia","family":"Speranza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00006-0_BIB1","series-title":"Dynamic Programming","author":"Bellman","year":"1957"},{"key":"10.1016\/S0022-0000(03)00006-0_BIB2","doi-asserted-by":"crossref","first-page":"1402","DOI":"10.1287\/opre.28.6.1402","article-title":"Hard knapsack problems","volume":"28","author":"Chvatal","year":"1980","journal-title":"Oper. Res."},{"key":"10.1016\/S0022-0000(03)00006-0_BIB3","unstructured":"D. Dor, U. Zwick, Selecting the median, in: Proceedings of the Sixth ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 28\u201335."},{"key":"10.1016\/S0022-0000(03)00006-0_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0022-0000(03)00006-0_BIB5","first-page":"31","article-title":"Approximation algorithms for certain universal problems in scheduling theory","volume":"6","author":"Gens","year":"1978","journal-title":"Soviet J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(03)00006-0_BIB6","series-title":"Optimization Techniques, Part 2","first-page":"185","article-title":"Fast approximation algorithms for knapsack type problems","volume":"Vol. 74","author":"Gens","year":"1980"},{"key":"10.1016\/S0022-0000(03)00006-0_BIB7","first-page":"143","article-title":"A fast approximation algorithm for the subset-sum problem","volume":"32","author":"Gens","year":"1994","journal-title":"INFOR"},{"key":"10.1016\/S0022-0000(03)00006-0_BIB8","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","article-title":"Fast approximation algorithms for the knapsack and sum of subset problems","volume":"22","author":"Ibarra","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(03)00006-0_BIB9","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(03)00006-0_BIB10","unstructured":"R.M. Karp, The fast approximate solution of hard combinatorial problems, Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica Publishing, Winnipeg, 1975, pp. 15\u201331."},{"key":"10.1016\/S0022-0000(03)00006-0_BIB11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1009813105532","article-title":"A new fully polynomial time approximation scheme for the knapsack problem","volume":"3","author":"Kellerer","year":"1999","journal-title":"J. Combin. Optim."},{"key":"10.1016\/S0022-0000(03)00006-0_BIB12","doi-asserted-by":"crossref","unstructured":"H. Kellerer, U. Pferschy, Improved dynamic programming in connection with an FPTAS for the knapsack problem, J. Combin. Optim., to appear.","DOI":"10.1023\/B:JOCO.0000021934.29833.6b"},{"key":"10.1016\/S0022-0000(03)00006-0_BIB13","unstructured":"H. Kellerer, U. Pferschy, M.G. Speranza, An efficient fully polynomial approximation scheme for the subset-sum problem, Proceedings of the Eighth ISAAC Symposium, Springer Lecture Notes in Computer Science, Vol. 1350, Springer, Berlin, 1997, pp. 394\u2013403."},{"key":"10.1016\/S0022-0000(03)00006-0_BIB14","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","article-title":"Fast approximation algorithms for knapsack problems","volume":"4","author":"Lawler","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0022-0000(03)00006-0_BIB15","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(81)90175-2","article-title":"A fully polynomial approximation algorithm for the 0\u20131 knapsack problem","volume":"8","author":"Magazine","year":"1981","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0022-0000(03)00006-0_BIB16","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BF02612360","article-title":"Worst-case analysis of greedy algorithms for the subset-sum problem","volume":"28","author":"Martello","year":"1984","journal-title":"Math. Programming"},{"key":"10.1016\/S0022-0000(03)00006-0_BIB17","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/0377-2217(85)90115-8","article-title":"Approximation schemes for the subset-sum problem","volume":"22","author":"Martello","year":"1985","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0022-0000(03)00006-0_BIB18","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/S0022-0000(03)00006-0_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1999.1034","article-title":"Linear time algorithms for knapsack problems with bounded weight","volume":"33","author":"Pisinger","year":"1999","journal-title":"J. Algorithms"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000060?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000060?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T22:28:33Z","timestamp":1553380113000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0022000003000060"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00006-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}