{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T21:22:40Z","timestamp":1692307360309},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,8,3]],"date-time":"2007-08-03T00:00:00Z","timestamp":1186099200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s10878-007-9094-0","type":"journal-article","created":{"date-parts":[[2007,8,1]],"date-time":"2007-08-01T21:37:57Z","timestamp":1186004277000},"page":"16-27","source":"Crossref","is-referenced-by-count":4,"title":["Almost optimal solutions for bin coloring problems"],"prefix":"10.1007","volume":"16","author":[{"given":"Mingen","family":"Lin","sequence":"first","affiliation":[]},{"given":"Zhiyong","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,8,3]]},"reference":[{"key":"9094_CR1","first-page":"46","volume-title":"Approximation algorithms for NP-hard problems","author":"E Coffman","year":"1997","unstructured":"Coffman E, Garey M, Johnson D (1997) Approximation algorithms for bin packing: a survey. In: Approximation algorithms for NP-hard problems. PWS, Boston, pp 46\u201393"},{"key":"9094_CR2","unstructured":"Golubchik L, Khanna S, Khuller S, Thurimella R, Zhu A (2000) Approximation algorithms for data placement on parallel disks. In: Symposium on discrete algorithms, pp 223\u2013232"},{"key":"9094_CR3","doi-asserted-by":"crossref","unstructured":"Krumke S, de Paepe W, Rambau J, Stougie L (2001) Online bin coloring. In: Proceedings of the 9th annual European symposium on algorithms, pp 74\u201385","DOI":"10.1007\/3-540-44676-1_6"},{"key":"9094_CR4","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/s004530010057","volume":"29","author":"H Shachnai","year":"2001","unstructured":"Shachnai H, Tamir T (2001) On two class-constrained version of the multiple knapsack problem. Algorithmica 29:442\u2013467","journal-title":"Algorithmica"},{"issue":"9","key":"9094_CR5","doi-asserted-by":"crossref","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 (2004) Efficient burst scheduling algorithms in optical burst-switched networks using geometric techniques. IEEE J Sel Areas Commun 22(9):1796\u20131811","journal-title":"IEEE J Sel Areas Commun"},{"key":"9094_CR6","first-page":"79","volume":"3230","author":"M Yoo","year":"1997","unstructured":"Yoo M, Qiao C (1997) A high speed protocol for bursty traffic in optical networks. Proc SPIE All-Opt Commun Syst 3230:79\u201390","journal-title":"Proc SPIE All-Opt Commun Syst"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9094-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9094-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9094-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:12Z","timestamp":1559261892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9094-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,3]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["9094"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9094-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,3]]}}}