{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:57:29Z","timestamp":1725573449331},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_10","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T08:24:24Z","timestamp":1133511864000},"page":"82-91","source":"Crossref","is-referenced-by-count":1,"title":["Almost Optimal Solutions for Bin Coloring Problems"],"prefix":"10.1007","author":[{"given":"Mingen","family":"Lin","sequence":"first","affiliation":[]},{"given":"Zhiyong","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Approximation Algorithms for NP-Hard Problems, pp. 46\u201393. PWS Publishing Company (1997)"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"1796","DOI":"10.1109\/JSAC.2004.835157","volume":"22","author":"J. Xu","year":"2004","unstructured":"Xu, J., Qiao, C., Li, J., Xu, G.: Efficient burst scheduling algorithms in optical burst-switched networks using geometric techniques. IEEE Journal on Selected Areas in Communications\u00a022, 1796\u20131811 (2004)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Yoo, M., Qiao, C.: A high speed protocol for bursty traffic in optical networks. In: Proc.\u00a0SPIE All-Opt.\u00a0Commun.\u00a0Syst., vol.\u00a03230, pp. 79\u201390 (1997)","DOI":"10.1117\/12.290398"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-44676-1_6","volume-title":"Algorithms - ESA 2001","author":"S.O. Krumke","year":"2001","unstructured":"Krumke, S.O., de Paepe, W.E., Rambau, J., Stougie, L.: Online bin coloring. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 74\u201385. Springer, Heidelberg (2001)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/3-540-44436-X_24","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"H. Schachnai","year":"2000","unstructured":"Schachnai, H., Tamir, T.: Polynomial time approximation schemes for class-constrained packing problems. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol.\u00a01913, pp. 238\u2013249. Springer, Heidelberg (2000)"},{"key":"10_CR6","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 version of the mutiple knapsack problem. Algorithmica\u00a029, 442\u2013467 (2001)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:02:26Z","timestamp":1619506946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11602613_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}