{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:14Z","timestamp":1725488594969},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_59","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:32:26Z","timestamp":1186727546000},"page":"525-534","source":"Crossref","is-referenced-by-count":0,"title":["Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems"],"prefix":"10.1007","author":[{"given":"Monaldo","family":"Mastrolilli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"59_CR1","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1973","unstructured":"M. Blum, R. W. Floyd, V. Pratt, R.L. Rivest, and R.E. Tarjan, Time bounds for selection, Journal of Computer and System Sciences 7 (1973), 448\u2013461.","journal-title":"Journal of Computer and System Sciences"},{"key":"59_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0377-2217(99)00261-1","volume":"123","author":"A. Caprara","year":"2000","unstructured":"A. Caprara, H. Kellerer, U. Pferschy, and D. Pisinger, Approximation algorithms for knapsack problems with cardinality constraints, European Journal of Operations Research 123 (2000), 333\u2013345.","journal-title":"European Journal of Operations Research"},{"key":"59_CR3","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to algorithms, 6th ed., MIT Press and McGraw-Hill Book Company, 1992."},{"key":"59_CR4","unstructured":"D.S. Hochbaum (ed.), Approximation algorithms for NP-hard problems, ITP, 1995."},{"key":"59_CR5","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. Assoc. Comput. Mach. 22 (1975), 463\u2013468.","journal-title":"J. Assoc. Comput. Mach."},{"key":"59_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BFb0053969","volume-title":"APPROX\u201998","author":"H. Kellerer","year":"1998","unstructured":"H. Kellerer and U. Pferschy, A new fully polynomial approximation scheme for the knapsack problem, APPROX\u201998 LNCS 1444 (1998), 123\u2013134."},{"key":"59_CR7","doi-asserted-by":"crossref","unstructured":"E. L. Lawler, Fast approximation algorithms for knapsack problems, Proc. 18th Ann. Symp. on Foundations of Computer Science (1977), 206\u2013218.","DOI":"10.1109\/SFCS.1977.11"},{"key":"59_CR8","unstructured":"S. Martello and P. Toth, Knapsack problems, Wiley, 1990."},{"key":"59_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0167-6377(93)90041-E","volume":"13","author":"N. Megiddo","year":"1993","unstructured":"N. Megiddo and A. Tamir, Linear time algorithms for some separable quadratic programming problems, Operations Research Letters 13 (1993), 203\u2013211.","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T04:47:13Z","timestamp":1550724433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_59","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}