{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:00:27Z","timestamp":1783576827317,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642152399","type":"print"},{"value":"9783642152405","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15240-5_23","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T11:30:15Z","timestamp":1280921415000},"page":"316-327","source":"Crossref","is-referenced-by-count":10,"title":["Approximating the Non-contiguous Multiple Organization Packing Problem"],"prefix":"10.1007","author":[{"given":"Marin","family":"Bougeret","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre Fran\u00e7ois","family":"Dutot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Klaus","family":"Jansen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christina","family":"Otte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1515\/156939206776241264","volume":"16","author":"S. Zhuk","year":"2006","unstructured":"Zhuk, S.: Approximate algorithms to pack rectangles into several strips. Discrete Mathematics and Applications\u00a016(1), 73\u201385 (2006)","journal-title":"Discrete Mathematics and Applications"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"E. Coffman Jr.","year":"1980","unstructured":"Coffman Jr., E., Garey, M., Johnson, D., Tarjan, R.: Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J. Comput.\u00a09, 808 (1980)","journal-title":"SIAM J. Comput."},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BFb0049416","volume-title":"Algorithms - ESA \u201994","author":"I. Schiermeyer","year":"1994","unstructured":"Schiermeyer, I.: Reverse-fit: A 2-optimal algorithm for packing rectangles. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 290\u2013299. Springer, Heidelberg (1994)"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0097539793255801","volume":"26","author":"A. Steinberg","year":"1997","unstructured":"Steinberg, A.: A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing\u00a026, 401 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Kenyon, C., R\u00e9mila, E.: A near-optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research, 645\u2013656 (2000)","DOI":"10.1287\/moor.25.4.645.12118"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-540-74456-6_11","volume-title":"Mathematical Foundations of Computer Science 2007","author":"K. Jansen","year":"2007","unstructured":"Jansen, K., Solis-Oba, R.: New approximability results for 2-dimensional packing problems. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, p. 103. Springer, Heidelberg (2007)"},{"key":"23_CR7","first-page":"165","volume-title":"Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications","author":"D. Ye","year":"2009","unstructured":"Ye, D., Han, X., Zhang, G.: On-Line Multiple-Strip Packing. In: Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications, p. 165. Springer, Heidelberg (2009)"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-12450-1_4","volume-title":"Approximation and Online Algorithms","author":"M. Bougeret","year":"2010","unstructured":"Bougeret, M., Dutot, P.-F., Jansen, K., Otte, C., Trystram, D.: Approximation algorithms for multiple strip packing. In: Bampis, E., Jansen, K. (eds.) Approximation and Online Algorithms. LNCS, vol.\u00a05893, pp. 37\u201348. Springer, Heidelberg (2010)"},{"issue":"2","key":"23_CR9","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/0204015","volume":"4","author":"M. Garey","year":"1975","unstructured":"Garey, M., Graham, R.: Bounds for multiprocessor scheduling with resource constraints. SIAM J. Comput.\u00a04(2), 187\u2013200 (1975)","journal-title":"SIAM J. Comput."},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Schwiegelshohn, U., Tchernykh, A., Yahyapour, R.: Online scheduling in grids. In: Proceedings of IPDPS, pp. 1\u201310 (2008)","DOI":"10.1109\/IPDPS.2008.4536273"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Dutot, P.-F., Pascual, F., Rzadca, K., Trystram, D.: Approximation algorithms for the multi-organization scheduling problem. IEEE Transactions on Parallel and Distributed Systems, TPDS (2010) (submitted )","DOI":"10.1109\/TPDS.2011.47"},{"key":"23_CR12","volume-title":"Handbook of Scheduling","author":"P.-F. Dutot","year":"2004","unstructured":"Dutot, P.-F., Mouni\u00e9, G., Trystram, D.: Scheduling Parallel Tasks: Approximation Algorithms. In: Handbook of Scheduling. CRC Press, Boca Raton (2004)"},{"issue":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D.S. Hochbaum","year":"1988","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J. Comput.\u00a017(3), 539\u2013551 (1988)","journal-title":"SIAM J. Comput."}],"container-title":["IFIP Advances in Information and Communication Technology","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15240-5_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:03:21Z","timestamp":1606169001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15240-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152399","9783642152405"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15240-5_23","relation":{},"ISSN":["1868-4238","1861-2288"],"issn-type":[{"value":"1868-4238","type":"print"},{"value":"1861-2288","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}