{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:50Z","timestamp":1725543470453},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540357537"},{"type":"electronic","value":"9783540357551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11785293_6","type":"book-chapter","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T01:24:10Z","timestamp":1151285050000},"page":"29-40","source":"Crossref","is-referenced-by-count":0,"title":["Variable Sized Online Interval Coloring with Bandwidth"],"prefix":"10.1007","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Erlebach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24592-6_1","volume-title":"Approximation and Online Algorithms","author":"U. Adamy","year":"2004","unstructured":"Adamy, U., Erlebach, T.: Online coloring of intervals with bandwidth. In: Solis-Oba, R., Jansen, K. (eds.) WAOA 2003. LNCS, vol.\u00a02909, pp. 1\u201312. Springer, Heidelberg (2004)"},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J. Aspnes","year":"1997","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S.A., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM\u00a044(3), 486\u2013504 (1997)","journal-title":"Journal of the ACM"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF00365406","volume":"4","author":"S.K. Baruah","year":"1992","unstructured":"Baruah, S.K., Koren, G., Mao, D., Mishra, B., Raghunathan, A., Rosier, L.E., Shasha, D., Wang, F.: On the competitiveness of on-line real-time task scheduling. Real-Time Systems\u00a04(2), 125\u2013144 (1992)","journal-title":"Real-Time Systems"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1051\/ita\/1988220404871","volume":"22","author":"M. Chrobak","year":"1988","unstructured":"Chrobak, M., \u015alusarek, M.: On some packing problems relating to dynamical storage allocation. RAIRO Journal on Information Theory and Applications\u00a022, 487\u2013499 (1988)","journal-title":"RAIRO Journal on Information Theory and Applications"},{"key":"6_CR5","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D. (ed.) Approximation algorithms. PWS Publishing Company (1997)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/BF00289157","volume":"26","author":"J. Csirik","year":"1989","unstructured":"Csirik, J.: An online algorithm for variable-sized bin packing. Acta Informatica\u00a026, 697\u2013709 (1989)","journal-title":"Acta Informatica"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BFb0029568","volume-title":"Online Algorithms: The State of the Art","author":"J. Csirik","year":"1998","unstructured":"Csirik, J., Woeginger, G.J.: On-line packing and covering problems. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms: The State of the Art. LNCS, vol.\u00a01442, pp. 147\u2013177. Springer, Heidelberg (1998)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/11523468_49","volume-title":"Automata, Languages and Programming","author":"L. Epstein","year":"2005","unstructured":"Epstein, L., Levy, M.: Online interval coloring and variants. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 602\u2013613. Springer, Heidelberg (2005)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/11549345_26","volume-title":"Mathematical Foundations of Computer Science 2005","author":"L. Epstein","year":"2005","unstructured":"Epstein, L., Levy, M.: Online interval coloring with packing constraints. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 295\u2013307. Springer, Heidelberg (2005)"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1137\/0215016","volume":"15","author":"D.K. Friesen","year":"1986","unstructured":"Friesen, D.K., Langston, M.A.: Variable sized bin packing. SIAM J. Comput.\u00a015, 222\u2013230 (1986)","journal-title":"SIAM J. Comput."},{"key":"6_CR11","volume-title":"Graph coloring problems","author":"T.R. Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph coloring problems. Wiley, Chichester (1995)"},{"issue":"4","key":"6_CR12","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1137\/0401048","volume":"1","author":"H.A. Kierstead","year":"1988","unstructured":"Kierstead, H.A.: The linearity of first-fit coloring of interval graphs. SIAM Journal on Discrete Mathematics\u00a01(4), 526\u2013530 (1988)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1137\/S0895480191218861","volume":"8","author":"H.A. Kierstead","year":"1995","unstructured":"Kierstead, H.A., Qin, J.: Coloring interval graphs with First-Fit. SIAM Journal on Discrete Mathematics\u00a08, 47\u201357 (1995)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"6_CR14","first-page":"143","volume":"33","author":"H.A. Kierstead","year":"1981","unstructured":"Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. Congressus Numerantium\u00a033, 143\u2013153 (1981)","journal-title":"Congressus Numerantium"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/0216012","volume":"16","author":"F.D. Murgolo","year":"1987","unstructured":"Murgolo, F.D.: An efficient approximation scheme for variable-sized bin packing. SIAM J. Comput.\u00a016(1), 149\u2013161 (1987)","journal-title":"SIAM J. Comput."},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-540-27798-9_36","volume-title":"Computing and Combinatorics","author":"N.S. Narayanaswamy","year":"2004","unstructured":"Narayanaswamy, N.S.: Dynamic storage allocation and online colouring interval graphs. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol.\u00a03106, pp. 329\u2013338. Springer, Heidelberg (2004)"},{"key":"6_CR17","unstructured":"Pemmaraju, S.V., Raman, R., Varadarajan, K.R.: Buffer minimization using max-coloring. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 562\u2013571 (2004)"},{"issue":"4","key":"6_CR18","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1137\/S0895480100369948","volume":"14","author":"S.S. Seiden","year":"2001","unstructured":"Seiden, S.S.: An optimal online algorithm for bounded space variable-sized bin packing. SIAM Journal on Discrete Mathematics\u00a014(4), 458\u2013470 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"5","key":"6_CR19","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"S.S. Seiden","year":"2002","unstructured":"Seiden, S.S.: On the online bin packing problem. Journal of the ACM\u00a049(5), 640\u2013671 (2002)","journal-title":"Journal of the ACM"},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/S0097539702412908","volume":"32","author":"S.S. Seiden","year":"2003","unstructured":"Seiden, S.S., van Stee, R., Epstein, L.: New bounds for variable-sized online bin packing. SIAM Journal on Computing\u00a032(2), 455\u2013469 (2003)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11785293_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:19:27Z","timestamp":1619493567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11785293_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540357537","9783540357551"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11785293_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}