{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:37:54Z","timestamp":1725489474099},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414131"},{"type":"electronic","value":"9783540444503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44450-5_8","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T04:26:08Z","timestamp":1187238368000},"page":"106-116","source":"Crossref","is-referenced-by-count":3,"title":["On-Line Edge-Coloring with a Fixed Number of Colors"],"prefix":"10.1007","author":[{"given":"Lene Monrad","family":"Favrholdt","sequence":"first","affiliation":[]},{"given":"Morten Nyhave","family":"Nielsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,11,24]]},"reference":[{"key":"8_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-44985-X_18","volume-title":"Fair versus unrestricted bin packing","author":"Y. Azar","year":"2000","unstructured":"Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, and Morten N. Nielsen. Fair versus unrestricted bin packing. In Seventh Scandinavian Workshop on Algorithm 0Theory, volume 1851 of Lecture Notes in Computer Science, pages 200\u2013213. Springer-Verlag, 2000."},{"issue":"5","key":"8_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0020-0190(92)90209-E","volume":"44","author":"A. Bar-Noy","year":"1992","unstructured":"Amotz Bar-Noy, Rajeev Motwani, and Joseph Naor. The greedy algorithm is optimal for on-line edge coloring. Information Processing Letters, 44(5):251\u2013253, 1992.","journal-title":"Information Processing Letters"},{"issue":"4","key":"8_CR3","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/PL00009286","volume":"25","author":"J. Boyar","year":"1999","unstructured":"J. Boyar and K. S. Larsen. The seat reservation problem. Algorithmica, 25(4):403\u2013417, 1999.","journal-title":"Algorithmica"},{"key":"8_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-48447-7_9","volume-title":"The accommodating function \u2014 a generalization of the competitive ratio","author":"J. Boyar","year":"1999","unstructured":"J. Boyar, K. S. Larsen, and M. N. Nielsen. The accommodating function \u2014 a generalization of the competitive ratio. In Sixth International Workshop on Algorithms and Data Structures, volume 1663 of Lecture Notes in Computer Science, pages 74\u201379. Springer-Verlag, 1999."},{"key":"8_CR5","unstructured":"Lene M. Favrholdt and Morten N. Nielsen. On-line edge-coloring with a fixed number of colors. Preprints 1999, no. 6, Department of Mathematics and Computer Science, University of Southern Denmark, Odense."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A. R. Karlin","year":"1988","unstructured":"Anna R. Karlin, Mark S. Manasse, Larry Rudolph, and Daniel D. Sleator. Competitive snoopy caching. Algorithmica, 3:79\u2013119, 1988.","journal-title":"Algorithmica"},{"key":"8_CR7","unstructured":"Douglas B. West. Introduction to Graph Theory, page 209. Prentice Hall, Inc., 1996."}],"container-title":["Lecture Notes in Computer Science","FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44450-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T21:54:50Z","timestamp":1550786090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44450-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414131","9783540444503"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44450-5_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}