{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T00:01:50Z","timestamp":1773187310475,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540638902","type":"print"},{"value":"9783540696629","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63890-3_42","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T17:12:11Z","timestamp":1270487531000},"page":"394-403","source":"Crossref","is-referenced-by-count":14,"title":["An efficient approximation scheme for the subset-sum problem"],"prefix":"10.1007","author":[{"given":"Hans","family":"Kellerer","sequence":"first","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":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"42_CR1","first-page":"31","volume":"6","author":"G. V. Gens","year":"1978","unstructured":"G. V. Gens and E. V. Levner. Approximation algorithms for certain universal problems in scheduling theory. Soviet J. of Comp. System Sci., 6:31\u201336, 1978.","journal-title":"Soviet J. of Comp. System Sci."},{"key":"42_CR2","series-title":"Lecture Notes in Control and Information Sciences","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BFb0006603","volume-title":"Optimization Techniques, Part 2","author":"G.V. Gens","year":"1980","unstructured":"G.V. Gens and E. V. Levner. Fast approximation algorithms for knapsack type problems. In K. Iracki, K. Malinowski, and S. Walukiewicz, editors, Optimization Techniques, Part 2, volume 74 of Lecture Notes in Control and Information Sciences, pages 185\u2013194. Springer, Berlin, 1980."},{"key":"42_CR3","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O. H. Ibarra","year":"1975","unstructured":"O. H. Ibarra and C. E. Kim. Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM, 22:463\u2013468, 1975.","journal-title":"J. ACM"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"H. Kellerer, R. Mansini, U. Pferschy, and M.G. Speranza. An efficient fully polynomial approximation scheme for the subset-sum problem. Technical report, University of Graz, Department of Business, 1997.","DOI":"10.1007\/3-540-63890-3_42"},{"key":"42_CR5","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"E. Lawler","year":"1979","unstructured":"E. Lawler. Fast approximation algorithms for knapsack problems. Math. Oper. Res., 4:339\u2013356, 1979.","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63890-3_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T14:27:59Z","timestamp":1685543279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63890-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638902","9783540696629"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-63890-3_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}