{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:30:36Z","timestamp":1761323436554},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540647362"},{"type":"electronic","value":"9783540690672"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0053969","type":"book-chapter","created":{"date-parts":[[2006,7,26]],"date-time":"2006-07-26T21:42:59Z","timestamp":1153950179000},"page":"123-134","source":"Crossref","is-referenced-by-count":14,"title":["A new fully polynomial approximation scheme for the knapsack 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"}]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"11_CR1","unstructured":"A. Caprara, H. Kellerer, U. Pferschy, D. Pisinger, \u201cApproximation algorithms for knapsack problems with cardinality constraints\u201d, Technical Report 01\/1998, Faculty of Economics, University Graz, submitted."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"H. Kellerer, R. Mansini, U. Pferschy, M.G. Speranza, \u201cAn efficient fully polynomial approximation scheme for the subset-sum problem\u201d, Technical Report 14\/1997, Fac. of Economics, Univ. Graz, submitted, see also Proceedings of the 8th ISAAC Symposium, Springer Lecture Notes in Computer Science 1350, 394\u2013403, 1997.","DOI":"10.1007\/3-540-63890-3_42"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"E. Lawler","year":"1979","unstructured":"E. Lawler, \u201cFast approximation algorithms for knapsack problems\u201d, Mathematics of Operations Research 4, 339\u2013356, 1979.","journal-title":"Mathematics of Operations Research"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0377-2217(81)90175-2","volume":"8","author":"M.J. Magazine","year":"1981","unstructured":"M.J. Magazine, O. Oguz, \u201cA fully polynomial approximation algorithm for the 0-1 knapsack problem\u201d, European Journal of Operational Research, 8, 270\u2013273, 1981.","journal-title":"European Journal of Operational Research"},{"key":"11_CR5","unstructured":"S. Martello, P. Toth, Knapsack Problems, J. Wiley & Sons, 1990."},{"key":"11_CR6","first-page":"1","volume-title":"Handbook of Combinatorial Optimization","author":"D. Pisinger","year":"1997","unstructured":"D. Pisinger, P. Toth, \u201cKnapsack Problems\u201d, in D.Z. Du, P. Pardalos (eds.) Handbook of Combinatorial Optimization, Kluwer, Norwell, 1\u201389, 1997."}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatiorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0053969","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:23:59Z","timestamp":1555748639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0053969"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647362","9783540690672"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0053969","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}