{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:46:53Z","timestamp":1760820413547},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642276590"},{"type":"electronic","value":"9783642276606"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-27660-6_26","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T15:14:28Z","timestamp":1326726868000},"page":"313-324","source":"Crossref","is-referenced-by-count":15,"title":["A Fast Approximation Scheme for the Multiple Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1137\/S1052623498348481","volume":"11","author":"A. Caprara","year":"2000","unstructured":"Caprara, A., Kellerer, H., Pferschy, U.: The multiple subset sum problem. SIAM Journal of Optimization\u00a011, 308\u2013319 (2000)","journal-title":"SIAM Journal of Optimization"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/S0097539700382820","volume":"35","author":"C. Chekuri","year":"2006","unstructured":"Chekuri, C., Khanna, S.: A PTAS for the multiple knapsack problem. SIAM Journal on Computing\u00a035, 713\u2013728 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-39890-5_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.R. Fellows","year":"2003","unstructured":"Fellows, M.R.: Blow-Ups, Win\/Win\u2019s, and Crown Rules: Some New Directions in FPT. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 1\u201312. Springer, Heidelberg (2003)"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1137\/080731207","volume":"39","author":"K. Jansen","year":"2009","unstructured":"Jansen, K.: Parameterized approximation scheme for the multiple knapsack problem. SIAM Journal on Computing\u00a039, 1392\u20131412 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, FOCS 1982, pp. 312\u2013320 (1982)","DOI":"10.1109\/SFCS.1982.61"},{"key":"26_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1287\/moor.25.4.645.12118","volume":"25","author":"C. Kenyon","year":"2000","unstructured":"Kenyon, C., Remila, E.: Approximate strip packing. Mathematics of Operations Research\u00a025, 645\u2013656 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","volume":"51","author":"D. Marx","year":"2008","unstructured":"Marx, D.: Parametrized complexity and approximation algorithms. The Computer Journal\u00a051, 60\u201378 (2008)","journal-title":"The Computer Journal"},{"key":"26_CR9","first-page":"93","volume":"20","author":"G. Scheithauer","year":"1997","unstructured":"Scheithauer, G., Terno, J.: Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem. European Journal of Operational Research\u00a020, 93\u2013100 (1997)","journal-title":"European Journal of Operational Research"},{"key":"26_CR10","unstructured":"Shmonin, G.: Parameterised integer programming, integer cones, and related problems, PhD thesis, Universit\u00e4t Paderborn (2007)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2012: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27660-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T23:52:45Z","timestamp":1556149965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27660-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642276590","9783642276606"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27660-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}