{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:51:23Z","timestamp":1725501083230},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744498"},{"type":"electronic","value":"9783540744504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74450-4_2","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T05:49:24Z","timestamp":1189748964000},"page":"12-23","source":"Crossref","is-referenced-by-count":0,"title":["Sequential Vector Packing"],"prefix":"10.1007","author":[{"given":"Mark","family":"Cieliebak","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Hall","sequence":"additional","affiliation":[]},{"given":"Riko","family":"Jacob","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Nunkesser","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Cieliebak, M., Hall, A., Jacob, R., Nunkesser, M.: Sequential vector packing. DELIS TR 0335, ETH Zurich (2006)"},{"key":"2_CR2","first-page":"49","volume-title":"Approximation Algorithms for Bin Packing: An updated Survey","author":"E. Coffman Jr.","year":"1984","unstructured":"Coffman Jr., E., Garey, M.R., Johnson, D.S.: Algorithm Design for Computer System Design. In: Approximation Algorithms for Bin Packing: An updated Survey, pp. 49\u2013106. Springer, Heidelberg (1984)"},{"key":"2_CR3","first-page":"48","volume":"4","author":"D. Coppersmith","year":"1989","unstructured":"Coppersmith, D., Raghavan, P.: Multidimensional on-line bin packing: Algorithms and worst-case analysis. Operations Research Letters\u00a04, 48\u201357 (1989)","journal-title":"Operations Research Letters"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0304-3975(01)00174-8","volume":"289","author":"E. Dantsin","year":"2002","unstructured":"Dantsin, E., Goerdt, A., Hirsch, E.A., Kannan, R., Kleinberg, J.M., Papadimitriou, C.H., Raghavan, P., Sch\u00f6ning, U.: A deterministic (2-2\/(k+1))n algorithm for k-sat based on local search. Theoretical Computer Science\u00a0289(1), 69\u201383 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"2_CR5","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U. Feige","year":"2001","unstructured":"Feige, U., Peleg, D., Kortsarz, G.: The dense k-subgraph problem. Algorithmica\u00a029(3), 410\u2013421 (2001)","journal-title":"Algorithmica"},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF01415672","volume":"42","author":"G. Galambos","year":"1995","unstructured":"Galambos, G., Woeginger, G.J.: On-line bin packing\u2014a restricted survey. Mathematical Methods of Operations Research\u00a042(1), 25\u201345 (1995)","journal-title":"Mathematical Methods of Operations Research"},{"key":"2_CR7","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979)"},{"key":"2_CR8","unstructured":"Approximation Algorithms. In: Hochbaum, D.S. (ed.) Approximation Algorithms For Bin Packing: A Survey, pp. 46\u201393. PWS Publishing Company (1997)"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. Journal of the ACM\u00a047, 617\u2013643 (2000)","journal-title":"Journal of the ACM"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1145\/258533.258570","volume-title":"STOC","author":"C. Phillips","year":"1997","unstructured":"Phillips, C., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. In: STOC. Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 140\u2013149. ACM Press, New York (1997)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s00453-001-0094-7","volume":"32","author":"U. Sch\u00f6ning","year":"2002","unstructured":"Sch\u00f6ning, U.: A probabilistic algorithm for k-SAT based on limited local search and restart. Algorithmica\u00a032, 615\u2013623 (2002)","journal-title":"Algorithmica"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/0167-6377(82)90046-3","volume":"1","author":"T.S. Wee","year":"1982","unstructured":"Wee, T.S., Magazine, M.J.: Assembly line balancing as generalized bin-packing. Operations Research Letters\u00a01, 56\u201358 (1982)","journal-title":"Operations Research Letters"},{"issue":"5","key":"2_CR13","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1287\/opre.51.5.759.16753","volume":"51","author":"J. Yang","year":"2003","unstructured":"Yang, J., Leung, J.Y.-T.: The ordered open-end bin-packing problem. Operations Research\u00a051(5), 759\u2013770 (2003)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Combinatorics, Algorithms, Probabilistic and Experimental Methodologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74450-4_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:28:04Z","timestamp":1619519284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74450-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744498","9783540744504"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74450-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}