{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:31:49Z","timestamp":1725543109345},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_46","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T13:41:33Z","timestamp":1155649293000},"page":"439-448","source":"Crossref","is-referenced-by-count":1,"title":["The Class Constrained Bin Packing Problem with Applications to Video-on-Demand"],"prefix":"10.1007","author":[{"given":"E. C.","family":"Xavier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. K.","family":"Miyazawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"46_CR1","unstructured":"Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard Problems, ch.\u00a02, PWS, pp. 46\u201393 (1997)"},{"key":"46_CR2","unstructured":"Dawande, M., Kalagnanam, J., Sethuraman, J.: Variable sized bin packing with color constraints. Technical report, IBM, T.J. Watson Research Center, NY (1998)"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"Dawande, M., Kalagnanam, J., Sethuraman, J.: Variable sized bin packing with color constraints. In: Proceedings of Graco 2001. Electronic Notes in Dicrete Mathematics, vol.\u00a07 (2001)","DOI":"10.1016\/S1571-0653(04)00248-3"},{"issue":"4","key":"46_CR4","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W.F. Vega de la","year":"1981","unstructured":"de la Vega, W.F., Lueker, G.S.: Bin packing can be solved within 1\u2009+\u2009\u03b5 in linear time. Combinatorica\u00a01(4), 349\u2013355 (1981)","journal-title":"Combinatorica"},{"key":"46_CR5","unstructured":"Golubchik, L., Khanna, S., Khuller, S., Thurimella, R., Zhu, A.: Approximation algorithms for data placement on parallel disks. In: Proceedings of SODA, pp. 223\u2013232 (2000)"},{"key":"46_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing\u00a03, 299\u2013325 (1974)","journal-title":"SIAM Journal on Computing"},{"key":"46_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-24597-1_23","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"S.R. Kashyap","year":"2003","unstructured":"Kashyap, S.R., Khuller, S.: Algorithms for non-uniform size data placement on parallel disks. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 265\u2013276. Springer, Heidelberg (2003)"},{"key":"46_CR8","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/s004530010057","volume":"29","author":"H. Shachnai","year":"2001","unstructured":"Shachnai, H., Tamir, T.: On two class-constrained versions of the multiple knapsack problem. Algorithmica\u00a029, 442\u2013467 (2001)","journal-title":"Algorithmica"},{"issue":"6","key":"46_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/jos.86","volume":"4","author":"H. Shachnai","year":"2001","unstructured":"Shachnai, H., Tamir, T.: Polynomial time approximation schemes for class-constrained packing problems. Journal of Scheduling\u00a04(6), 313\u2013338 (2001)","journal-title":"Journal of Scheduling"},{"key":"46_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/978-3-540-45198-3_15","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"H. Shachnai","year":"2003","unstructured":"Shachnai, H., Tamir, T.: Approximation schemes for generalized 2-dimensional vector packing with application to data placement. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol.\u00a02764, pp. 165\u2013177. Springer, Heidelberg (2003)"},{"issue":"1","key":"46_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tcs.2003.05.006","volume":"321","author":"H. Shachnai","year":"2004","unstructured":"Shachnai, H., Tamir, T.: Tight bounds for online class-constrained packing. Theoretical Computer Science\u00a0321(1), 103\u2013123 (2004)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:26:41Z","timestamp":1619508401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11809678_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}