{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:54Z","timestamp":1725558414787},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_35","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T11:00:50Z","timestamp":1276167650000},"page":"371-382","source":"Crossref","is-referenced-by-count":2,"title":["Better Bounds on Online Unit Clustering"],"prefix":"10.1007","author":[{"given":"Martin R.","family":"Ehmsen","sequence":"first","affiliation":[]},{"given":"Kim S.","family":"Larsen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"35_CR1","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/s00224-007-9085-7","volume":"45","author":"T.M. Chan","year":"2009","unstructured":"Chan, T.M., Zarrabi-Zadeh, H.: A randomized algorithm for online unit clustering. Theory of Computing Systems\u00a045(3), 486\u2013496 (2009)","journal-title":"Theory of Computing Systems"},{"issue":"6","key":"35_CR2","doi-asserted-by":"publisher","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":"35_CR3","unstructured":"Ehmsen, M.R., Larsen, K.S.: Better Bounds on Online Unit Clustering. Preprint\u00a08, Department of Mathematics and Computer Science, University of Southern Denmark (2009)"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2008.04.046","volume":"407","author":"L. Epstein","year":"2008","unstructured":"Epstein, L., Levin, A., van Stee, R.: Online unit clustering: Variations on a theme. Theoretical Computer Science\u00a0407, 85\u201396 (2008)","journal-title":"Theoretical Computer Science"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Epstein, L., van Stee, R.: On the online unit clustering problem. In: Proceedings of the 5th International Workshop on Approximation and Online Algorithms, pp. 193\u2013206 (2007)","DOI":"10.1007\/978-3-540-77918-6_16"},{"key":"35_CR6","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Systems Technical Journal\u00a045, 1563\u20131581 (1966)","journal-title":"Bell Systems Technical Journal"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A.R. Karlin","year":"1988","unstructured":"Karlin, A.R., Manasse, M.S., Rudolph, L., Sleator, D.D.: Competitive snoopy caching. Algorithmica\u00a03, 79\u2013119 (1988)","journal-title":"Algorithmica"},{"issue":"2","key":"35_CR8","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Communications of the ACM"},{"issue":"4","key":"35_CR9","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/s00453-008-9208-9","volume":"54","author":"H. Zarrabi-Zadeh","year":"2009","unstructured":"Zarrabi-Zadeh, H., Chan, T.M.: An improved algorithm for online unit clustering. Algorithmica\u00a054(4), 490\u2013500 (2009)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:42:25Z","timestamp":1606185745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}