{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:07:55Z","timestamp":1725502075079},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540779179"},{"type":"electronic","value":"9783540779186"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-77918-6_16","type":"book-chapter","created":{"date-parts":[[2008,2,8]],"date-time":"2008-02-08T03:41:19Z","timestamp":1202442079000},"page":"193-206","source":"Crossref","is-referenced-by-count":1,"title":["On the Online Unit Clustering Problem"],"prefix":"10.1007","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/11970125_10","volume-title":"Approximation and Online Algorithms","author":"T.M. Chan","year":"2007","unstructured":"Chan, T.M., Zarrabi-Zadeh, H.: A randomized algorithm for onine unit clustering. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol.\u00a04368, pp. 121\u2013131. Springer, Heidelberg (2007)"},{"issue":"6","key":"16_CR2","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1137\/S0097539702418498","volume":"33","author":"M. Charikar","year":"2004","unstructured":"Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental clustering and dynamic information retrieval. SIAM Journal on Computing\u00a033(6), 1417\u20131440 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR3","doi-asserted-by":"publisher","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 Theory\u00a012, 217\u2013227 (1988)","journal-title":"J. Graph Theory"},{"key":"16_CR4","first-page":"143","volume":"33","author":"H.A. Kierstead","year":"1981","unstructured":"Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. Congr. Numer.\u00a033, 143\u2013153 (1981)","journal-title":"Congr. Numer."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BFb0029574","volume-title":"Online Algorithms: The State of the Art","author":"H.A. Kierstead","year":"1998","unstructured":"Kierstead, H.A.: Coloring graphs on-line. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms: The State of the Art, pp. 281\u2013305. Springer, Heidelberg (1998)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0012-365X(89)90096-4","volume":"75","author":"L. Lov\u00e1sz","year":"1989","unstructured":"Lov\u00e1sz, L., Saks, M.E., Trotter, W.T.: An on-line graph coloring algorithm with sublinear performance ratio. Discrete Math.\u00a075, 319\u2013325 (1989)","journal-title":"Discrete Math."},{"key":"16_CR7","first-page":"222","volume-title":"FOCS. Proc. 18th Symp. Foundations of Computer Science","author":"A.C.C. Yao","year":"1977","unstructured":"Yao, A.C.C.: Probabilistic computations: towards a unified measure of complexity. In: FOCS. Proc. 18th Symp. Foundations of Computer Science, pp. 222\u2013227. IEEE, Los Alamitos (1977)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/978-3-540-73545-8_38","volume-title":"COCOON 2007. Proc. 13th Annual International Conference on Computing and Combinatorics","author":"H. Zarrabi-Zadeh","year":"2007","unstructured":"Zarrabi-Zadeh, H., Chan, T.M.: An improved algorithm for online unit clustering. In: COCOON 2007. Proc. 13th Annual International Conference on Computing and Combinatorics. LNCS, vol.\u00a04598, pp. 383\u2013393. Springer, Heidelberg (2007)"}],"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-540-77918-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T23:38:07Z","timestamp":1548373087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77918-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540779179","9783540779186"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77918-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}