{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T08:34:07Z","timestamp":1676018047464},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s00236-013-0184-4","type":"journal-article","created":{"date-parts":[[2013,8,21]],"date-time":"2013-08-21T12:11:50Z","timestamp":1377087110000},"page":"343-357","source":"Crossref","is-referenced-by-count":4,"title":["Online multi-coloring on the path revisited"],"prefix":"10.1007","volume":"50","author":[{"given":"Marie G.","family":"Christ","sequence":"first","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"}]}],"member":"297","published-online":{"date-parts":[[2013,8,22]]},"reference":[{"key":"184_CR1","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"184_CR2","doi-asserted-by":"crossref","unstructured":"Chan, J., Chin, F., Ye, D., Zhang, Y., Zhu, H.: Frequency allocation problems for linear cellular networks. In: 17th International Symposium on Algorithms and Computation, LNCS, vol. 4288, pp. 61\u201370. Springer, Berlin (2006)","DOI":"10.1007\/11940128_8"},{"key":"184_CR3","unstructured":"Chan, J., Chin, F., Ye, D., Zhang, Y., Zhu, H.: Frequency allocation problems for linear cellular networks, full version (2011) (Personal communication)"},{"key":"184_CR4","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Sgall, J.: Three results on frequency assignment in linear cellular networks. In: 5th International Conference on Algorithmic Aspects in Information and Management, LNCS, vol. 5564, pp. 129\u2013139. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-02158-9_12"},{"key":"184_CR5","volume-title":"Probability: Theory and Examples","author":"R Durrett","year":"1991","unstructured":"Durrett, R.: Probability: Theory and Examples. Dixbury Press, Belmont (1991)"},{"key":"184_CR6","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45, 1563\u20131581 (1966)","journal-title":"Bell Syst. Tech. J."},{"key":"184_CR7","doi-asserted-by":"crossref","unstructured":"Hoffmann-J\u00f8rgensen, J.: Probability with a View towards Statistics, Chapman & Hall Probability Series, vol. I. Chapman & Hall, London (1994)","DOI":"10.1007\/978-1-4899-3019-4"},{"issue":"2","key":"184_CR8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jagm.1999.1068","volume":"36","author":"J Janssen","year":"2000","unstructured":"Janssen, J., Krizanc, D., Narayanan, L., Shende, S.: Distributed online frequency assignment in cellular networks. J. Algorithms 36(2), 119\u2013151 (2000)","journal-title":"J. Algorithms"},{"key":"184_CR9","volume-title":"Graph Coloring Problems","author":"T Jensen","year":"1995","unstructured":"Jensen, T., Toft, B.: Graph Coloring Problems. Wiley, London (1995)"},{"key":"184_CR10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A Karlin","year":"1988","unstructured":"Karlin, A., Manasse, M., Rudolph, L., Sleator, D.: Competitive snoopy caching. Algorithmica 3, 79\u2013119 (1988)","journal-title":"Algorithmica"},{"issue":"2","key":"184_CR11","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"issue":"1","key":"184_CR12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.jalgor.2004.09.001","volume":"55","author":"P Sparl","year":"2005","unstructured":"Sparl, P., Zerovnik, J.: 2-local 4\/3-competitive algorithm for multicoloring hexagonal graphs. J Algorithms 55(1), 29\u201341 (2005)","journal-title":"J Algorithms"},{"key":"184_CR13","doi-asserted-by":"crossref","unstructured":"Witkowski, R., Zerovnik, J.: 1-local 33\/24-competitive algorithm for multicoloring hexagonal graphs. In: 8th International Workshop on Algorithms and Models for the Web Graph, LNCS, vol. 6732, pp. 74\u201384 (2011)","DOI":"10.1007\/978-3-642-21286-4_7"},{"key":"184_CR14","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Probabilistic computations: toward a unified measure of complexity. In: 18th FOCS, pp. 222\u2013227 (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-013-0184-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-013-0184-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-013-0184-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,21]],"date-time":"2019-07-21T15:18:49Z","timestamp":1563722329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-013-0184-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,22]]},"references-count":14,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["184"],"URL":"https:\/\/doi.org\/10.1007\/s00236-013-0184-4","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,22]]}}}