{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:54:44Z","timestamp":1725490484049},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742395"},{"type":"electronic","value":"9783540742401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74240-1_25","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T07:04:18Z","timestamp":1188198258000},"page":"288-299","source":"Crossref","is-referenced-by-count":3,"title":["Multi-dimensional Packing with Conflicts"],"prefix":"10.1007","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[]},{"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1287\/moor.1050.0168","volume":"31","author":"N. Bansal","year":"2006","unstructured":"Bansal, N., Correa, J., Kenyon, C., Sviridenko, M.: Bin packing in multiple dimensions: Inapproximability results and approximation schemes. Mathematics of Operations Research\u00a031(1), 31\u201349 (2006)","journal-title":"Mathematics of Operations Research"},{"key":"25_CR2","unstructured":"Bansal, N., Sviridenko, M.: New approximability and inapproximability results for 2-dimensional packing. In: Proceedings of the 15th Annual Symposium on Discrete Algorithms, pp. 189\u2013196. ACM\/SIAM (2004)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Packing 2-dimensional bins in harmony. In: Proc. 43rd Annual Symposium on Foundations of Computer Science, pp. 490\u2013499 (2002)","DOI":"10.1109\/SFCS.2002.1181973"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1137\/0603007","volume":"3","author":"F.R.K. Chung","year":"1982","unstructured":"Chung, F.R.K., Garey, M.R., Johnson, D.S.: On packing two-dimensional bins. SIAM Journal on Algebraic and Discrete Methods\u00a03, 66\u201376 (1982)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"25_CR5","unstructured":"Correa, J., Kenyon, C.: Approximation schemes for multidimensional packing. In: Proceedings of the 15th ACM\/SIAM Symposium on Discrete Algorithms, pp. 179\u2013188. ACM\/SIAM (2004)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Epstein, L., Levin, A.: On bin packing with conflicts. In: Proc. of the 4th Workshop on Approximation and online Algorithms (WAOA2006), pp. 160\u2013173 (2006)","DOI":"10.1007\/11970125_13"},{"key":"25_CR7","first-page":"207","volume-title":"Proc. of 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004)","author":"L. Epstein","year":"2004","unstructured":"Epstein, L., van Stee, R.: Optimal online bounded space multidimensional packing. In: Proc. of 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 207\u2013216. ACM Press, New York (2004)"},{"key":"25_CR8","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. W. H. Freeman and Company, New York (1979)"},{"issue":"2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E. Horowitz","year":"1976","unstructured":"Horowitz, E., Sahni, S.: Exact and approximate algorithms for scheduling nonidentical processors. Journal of the ACM\u00a023(2), 317\u2013327 (1976)","journal-title":"Journal of the ACM"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1017\/S0963548300001826","volume":"5","author":"M. Hujter","year":"1996","unstructured":"Hujter, M., Tuza, Z.: Precoloring extension, III: Classes of perfect graphs. Combinatorics, Probability and Computing\u00a05, 35\u201356 (1996)","journal-title":"Combinatorics, Probability and Computing"},{"issue":"4","key":"25_CR11","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/A:1009871302966","volume":"3","author":"K. Jansen","year":"1999","unstructured":"Jansen, K.: An approximation scheme for bin packing with conflicts. Journal of Combinatorial Optimization\u00a03(4), 363\u2013377 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/inco.1996.2616","volume":"132","author":"K. Jansen","year":"1997","unstructured":"Jansen, K., \u00d6hring, S.: Approximation algorithms for time constrained scheduling. Information and Computation\u00a0132, 85\u2013108 (1997)","journal-title":"Information and Computation"},{"issue":"4","key":"25_CR13","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., R\u00e9mila, E.: A near optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research\u00a025(4), 645\u2013656 (2000)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"25_CR14","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s00453-004-1102-5","volume":"40","author":"Y. Kohayakawa","year":"2004","unstructured":"Kohayakawa, Y., Miyazawa, F.K., Raghavan, P., Wakabayashi, Y.: Multidimensional cube packing. Algorithmica\u00a040(3), 173\u2013187 (2004)","journal-title":"Algorithmica"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0743-7315(90)90019-L","volume":"10","author":"J.Y.-T. Leung","year":"1990","unstructured":"Leung, J.Y.-T., Tam, T.W., Wong, C.S., Young, G.H., Chin, F.Y.L.: Packing squares into a square. Journal on Parallel and Distributed Computing\u00a010, 271\u2013275 (1990)","journal-title":"Journal on Parallel and Distributed Computing"},{"key":"25_CR16","unstructured":"Marx, D.: Precoloring extension, http:\/\/www.cs.bme.hu\/dmarx\/prext.html"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Marx, D.: Precoloring extension on chordal graphs. In: Graph Theory in Paris. Proceedings of a Conference in Memory of Claude Berge, Trends in Mathematics, pp. 255\u2013270. Birkh\u00e4user (2007)","DOI":"10.1007\/978-3-7643-7400-6_20"},{"key":"25_CR18","unstructured":"McCloskey, B., Shankar, A.: Approaches to bin packing with clique-graph conflicts. Technical Report UCB\/CSD-05-1378, EECS Department, University of California, Berkeley (2005)"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/S0021-9800(68)80047-X","volume":"5","author":"A. Meir","year":"1968","unstructured":"Meir, A., Moser, L.: On packing of squares and cubes. J. Combinatorial Theory Ser. A\u00a05, 126\u2013134 (1968)","journal-title":"J. Combinatorial Theory Ser. A"},{"key":"25_CR20","unstructured":"Oh, Y., Son, S.H.: On a constrained bin-packing problem. Technical Report CS-95-14, Department of Computer Science, University of Virginia (1995)"},{"issue":"3","key":"25_CR21","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00453-003-1016-7","volume":"36","author":"S.S. Seiden","year":"2003","unstructured":"Seiden, S.S., van Stee, R.: New bounds for multi-dimensional packing. Algorithmica\u00a036(3), 261\u2013293 (2003)","journal-title":"Algorithmica"},{"issue":"6","key":"25_CR22","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.orl.2004.02.003","volume":"32","author":"R. Stee van","year":"2004","unstructured":"van Stee, R.: An approximation algorithm for square packing. Operations Research Letters\u00a032(6), 535\u2013539 (2004)","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\/978-3-540-74240-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T12:20:16Z","timestamp":1556799616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74240-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540742395","9783540742401"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74240-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}