{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:33Z","timestamp":1759638213244},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,7,3]],"date-time":"2008-07-03T00:00:00Z","timestamp":1215043200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s00453-008-9208-9","type":"journal-article","created":{"date-parts":[[2008,7,2]],"date-time":"2008-07-02T10:58:55Z","timestamp":1214996335000},"page":"490-500","source":"Crossref","is-referenced-by-count":14,"title":["An Improved Algorithm for Online Unit Clustering"],"prefix":"10.1007","volume":"54","author":[{"given":"Hamid","family":"Zarrabi-Zadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timothy M.","family":"Chan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,7,3]]},"reference":[{"key":"9208_CR1","series-title":"Lecture Notes in Computer Science","first-page":"121","volume-title":"Proceedings of the 4th Workshop on Approximation and Online Algorithms","author":"T.M. Chan","year":"2006","unstructured":"Chan, T.M., Zarrabi-Zadeh, H.: A randomized algorithm for online unit clustering. In: Proceedings of the 4th Workshop on Approximation and Online Algorithms. Lecture Notes in Computer Science, vol. 4368, pp. 121\u2013131. Springer, Berlin (2006). To appear in Theory of Computing Systems"},{"issue":"6","key":"9208_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 J. Comput. 33(6), 1417\u20131440 (2004)","journal-title":"SIAM J. Comput."},{"key":"9208_CR3","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"9208_CR4","series-title":"Lecture Notes in Computer Science","first-page":"193","volume-title":"Proceedings of the 5th Workshop on Approximation and Online Algorithms","author":"L. Epstein","year":"2007","unstructured":"Epstein, L., van Stee, R.: On the online unit clustering problem. In: Proceedings of the 5th Workshop on Approximation and Online Algorithms. Lecture Notes in Computer Science, vol. 4927, pp. 193\u2013206. Springer, Berlin (2007)"},{"key":"9208_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/978-3-540-30140-0_32","volume-title":"Proceedings of the 12th Annual European Symposium on Algorithms","author":"D. Fotakis","year":"2004","unstructured":"Fotakis, D.: Incremental algorithms for facility location and k-median. In: Proceedings of the 12th Annual European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 3221, pp. 347\u2013358. Springer, Berlin (2004)"},{"issue":"3","key":"9208_CR6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"R.J. Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett. 12(3), 133\u2013137 (1981)","journal-title":"Inf. Process. Lett."},{"key":"9208_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(91)90075-S","volume":"40","author":"T. Gonzalez","year":"1991","unstructured":"Gonzalez, T.: Covering a set of points in multidimensional space. Inf. Process. Lett. 40, 181\u2013188 (1991)","journal-title":"Inf. Process. Lett."},{"key":"9208_CR8","doi-asserted-by":"crossref","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 12, 217\u2013227 (1988)","journal-title":"J. Graph Theory"},{"key":"9208_CR9","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32, 130\u2013136 (1985)","journal-title":"J. ACM"},{"key":"9208_CR10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(94)00285-Q","volume":"8","author":"H.A. Kierstead","year":"1995","unstructured":"Kierstead, H.A., Qin, J.: Coloring interval graphs with First-Fit. SIAM J. Discrete Math. 8, 47\u201357 (1995)","journal-title":"SIAM J. Discrete Math."},{"key":"9208_CR11","doi-asserted-by":"crossref","unstructured":"Meyerson, A.: Online facility location. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 426\u2013433 (2001)","DOI":"10.1109\/SFCS.2001.959917"},{"key":"9208_CR12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0304-3975(98)00336-3","volume":"246","author":"F. Nielsen","year":"2000","unstructured":"Nielsen, F.: Fast stabbing of boxes in high dimensions. Theor. Comput. Sci. 246, 53\u201372 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"9208_CR13","unstructured":"Tanimoto, S.L., Fowler, R.J.: Covering image subsets with patches. In: Proceedings of the 5th International Conference on Pattern Recognition, pp. 835\u2013839 (1980)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9208-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-008-9208-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9208-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:02Z","timestamp":1559123102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9208-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,3]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["9208"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9208-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,3]]}}}