{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:59:30Z","timestamp":1725483570194},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424703"},{"type":"electronic","value":"9783540446668"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44666-4_11","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T12:58:07Z","timestamp":1178197087000},"page":"63-75","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Schemes for Ordered Vector Packing Problems"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Caprara","sequence":"first","affiliation":[]},{"given":"Hans","family":"Kellerer","sequence":"additional","affiliation":[]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"A. Caprara, P. Toth, \u201cLower Bounds and Algorithms for the 2-Dimensional Vector Packing Problem\u201d, to appear in Discrete Applied Mathematics (2001).","DOI":"10.1016\/S0166-218X(00)00267-5"},{"key":"11_CR2","unstructured":"C. Chekuri, S. Khanna, \u201cOn Multi-dimensional Packing Problems\u201d, in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201999), ACM Press (1999)."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W. Fernandez de la Vega","year":"1981","unstructured":"W. Fernandez de la Vega, G.S. Luecker, \u201cBin packing can be solved within 1 + \u03c4 in linear time\u201d, Combinatorica 1 (1981), 349\u2013355.","journal-title":"Combinatorica"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0097-3165(76)90001-7","volume":"21","author":"M.R. Garey","year":"1976","unstructured":"M.R. Garey, R.L. Graham, D.S. Johnson, A.C. Yao, \u201cResource constrained scheduling as generalized bin packing\u201d, J. Combinatorial Theory Ser. A 21 (1976), 257\u2013298.","journal-title":"J. Combinatorial Theory Ser. A"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, 1988.","DOI":"10.1007\/978-3-642-97881-4"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1018947117526","volume":"92","author":"H. Kellerer","year":"1999","unstructured":"H. Kellerer, U. Pferschy, \u201cCardinality Constrained Bin-Packing Problems\u201d, Annals of Operations Research 92 (1999), 335\u2013348.","journal-title":"Annals of Operations Research"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1145\/321906.321917","volume":"22","author":"K.L. Krause","year":"1975","unstructured":"K.L. Krause, V.Y. Shen, H.D. Schwetman, \u201cAnalysis of several task-scheduling algorithms for a model of multiprogramming computer systems\u201d, Journal of the ACM 22 (1975), 522\u2013550.","journal-title":"Journal of the ACM"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF00999302","volume":"6","author":"K. Maruyama","year":"1977","unstructured":"K. Maruyama, S.K. Chang, D.T. Tang, \u201cA General Packing Algorithm for Multidimensional Resource Requirements\u201d, International Journal Comput. Inform. Sci. 6 (1977), 131\u2013149.","journal-title":"International Journal Comput. Inform. Sci."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0305-0548(94)90059-0","volume":"21","author":"F.C.R. Spieksma","year":"1994","unstructured":"F.C.R. Spieksma, \u201cA Branch-and-Bound Algorithm for the Two-Dimensional Vector Packing Problem\u201d, Computers and Operations Research 21 (1994), 19\u201325.","journal-title":"Computers and Operations Research"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0020-0190(97)00179-8","volume":"64","author":"G. J. Woeginger","year":"1997","unstructured":"G. J. Woeginger, \u201cThere is no Asymptotic PTAS for Two-Dimensional Vector Packing\u201d, Information Processing Letters 64 (1997), 293\u2013297.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44666-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T13:26:25Z","timestamp":1556371585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44666-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424703","9783540446668"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44666-4_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}