{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:34:45Z","timestamp":1725878085271},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319517407"},{"type":"electronic","value":"9783319517414"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-51741-4_5","type":"book-chapter","created":{"date-parts":[[2017,1,6]],"date-time":"2017-01-06T08:06:46Z","timestamp":1483690006000},"page":"52-64","source":"Crossref","is-referenced-by-count":1,"title":["Batch Coloring of Graphs"],"prefix":"10.1007","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leah","family":"Epstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lene M.","family":"Favrholdt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim S.","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,7]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.disopt.2016.04.007","volume":"21","author":"J Balogh","year":"2016","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, G., Galambos, G., Tan, Z.: Lower bound for 3-batched bin packing. Discrete Optim. 21, 14\u201324 (2016)","journal-title":"Discrete Optim."},{"issue":"1\u20132","key":"5_CR2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s00607-008-0023-6","volume":"84","author":"J Balogh","year":"2009","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., Galambos, G., Mark\u00f3t, M.C.: Improved lower bounds for semi-online bin packing problems. Computing 84(1\u20132), 139\u2013148 (2009)","journal-title":"Computing"},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/inco.1997.2677","volume":"140","author":"A Bar-Noy","year":"1998","unstructured":"Bar-Noy, A., Bellare, M., Halldorsson, M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inf. Comput. 140, 183\u2013202 (1998)","journal-title":"Inf. Comput."},{"key":"5_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2011.11.010","volume":"418","author":"A Borodin","year":"2012","unstructured":"Borodin, A., Ivan, I., Ye, Y., Zimny, B.: On sum coloring and sum multi-coloring for restricted families of graphs. Theoret. Comput. Sci. 418, 1\u201313 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Boyar, J., Epstein, L., Favrholdt, L.M., Larsen, K.S., Levin, A.: Batch coloring of graphs. Technical report arXiv:1610.02997 [cs.DS], arXiv (2016)","DOI":"10.1007\/978-3-319-51741-4_5"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"D\u00f3sa, G.: Batched bin packing revisited. J. Sched. (2015, in press)","DOI":"10.1007\/s10951-015-0431-3"},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.orl.2016.02.006","volume":"44","author":"L Epstein","year":"2016","unstructured":"Epstein, L.: More on batched bin packing. Oper. Res. Lett. 44, 273\u2013277 (2016)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"5_CR8","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.disopt.2004.11.001","volume":"2","author":"G Gutin","year":"2005","unstructured":"Gutin, G., Jensen, T., Yeo, A.: Batched bin packing. Discrete Optim. 2, 71\u201382 (2005)","journal-title":"Discrete Optim."},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/jgt.3190120212","volume":"12","author":"A Gy\u00e1rf\u00e1s","year":"1988","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J.: On-line and first-fit colorings of graphs. J. Graph Theor. 12, 217\u2013227 (1988)","journal-title":"J. Graph Theor."},{"issue":"C","key":"5_CR11","first-page":"168","volume":"29","author":"A Gy\u00e1rf\u00e1s","year":"1990","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J.: First fit and on-line chromatic number of families of graphs. Ars Combinatoria 29(C), 168\u2013176 (1990)","journal-title":"Ars Combinatoria"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M.: Online coloring known graphs. Electron. J. Comb. 7 (2000)","DOI":"10.37236\/1485"},{"issue":"1","key":"5_CR13","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0304-3975(94)90157-0","volume":"130","author":"MM Halld\u00f3rsson","year":"1994","unstructured":"Halld\u00f3rsson, M.M., Szegedy, M.: Lower bounds for on-line graph coloring. Theoret. Comput. Sci. 130(1), 163\u2013174 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.ejc.2015.05.015","volume":"51","author":"HA Kierstead","year":"2016","unstructured":"Kierstead, H.A., Smith, D.A., Trotter, W.T.: First-fit coloring on interval graphs has performance ratio at least 5. Eur. J. Comb. 51, 236\u2013254 (2016)","journal-title":"Eur. J. Comb."},{"key":"5_CR15","first-page":"143","volume":"33","author":"HA Kierstead","year":"1981","unstructured":"Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. Congr. Numer. 33, 143\u2013153 (1981)","journal-title":"Congr. Numer."},{"issue":"30","key":"5_CR16","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1155\/S0161171204306216","volume":"2004","author":"E Kubicka","year":"2004","unstructured":"Kubicka, E.: The chromatic sum of a graph: history and recent developments. Int. J. Math. Math. Sci. 2004(30), 1563\u20131573 (2004)","journal-title":"Int. J. Math. Math. Sci."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Kubicka, E., Schwenk, A.J.: An introduction to chromatic sums. In: 17th ACM Computer Science Conference, pp. 39\u201345. ACM Press (1989)","DOI":"10.1145\/75427.75430"},{"issue":"1","key":"5_CR18","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s11083-008-9076-6","volume":"25","author":"NS Narayanaswamy","year":"2008","unstructured":"Narayanaswamy, N.S., Babu, R.S.: A note on first-fit coloring of interval graphs. Order 25(1), 49\u201353 (2008)","journal-title":"Order"},{"issue":"2","key":"5_CR19","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/PL00009252","volume":"23","author":"S Nicolosoi","year":"1999","unstructured":"Nicolosoi, S., Sarrafzadeh, M., Song, X.: On the sum coloring problem on interval graphs. Algorithmica 23(2), 109\u2013126 (1999)","journal-title":"Algorithmica"},{"key":"5_CR20","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s11518-006-0121-y","volume":"12","author":"G Zhang","year":"2003","unstructured":"Zhang, G., Cai, X., Wong, C.K.: Scheduling two groups of jobs with incomplete information. J. Syst. Sci. Syst. Eng. 12, 73\u201381 (2003)","journal-title":"J. Syst. Sci. Syst. Eng."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51741-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T16:32:10Z","timestamp":1601310730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51741-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319517407","9783319517414"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51741-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}