{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:47:15Z","timestamp":1725490035235},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735441"},{"type":"electronic","value":"9783540735458"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73545-8_38","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T09:44:11Z","timestamp":1187343851000},"page":"383-393","source":"Crossref","is-referenced-by-count":2,"title":["An Improved Algorithm for Online Unit Clustering"],"prefix":"10.1007","author":[{"given":"Hamid","family":"Zarrabi-Zadeh","sequence":"first","affiliation":[]},{"given":"Timothy M.","family":"Chan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_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 online unit clustering. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol.\u00a04368, pp. 121\u2013131. Springer, Heidelberg (2007)"},{"issue":"6","key":"38_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 J. Comput.\u00a033(6), 1417\u20131440 (2004)","journal-title":"SIAM J. Comput."},{"key":"38_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":"38_CR4","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":"Algorithms \u2013 ESA 2004","author":"D. Fotakis","year":"2004","unstructured":"Fotakis, D.: Incremental algorithms for facility location and k-median. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 347\u2013358. Springer, Heidelberg (2004)"},{"issue":"3","key":"38_CR5","doi-asserted-by":"publisher","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. Inform. Process. Lett.\u00a012(3), 133\u2013137 (1981)","journal-title":"Inform. Process. Lett."},{"key":"38_CR6","doi-asserted-by":"publisher","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. Inform. Process. Lett.\u00a040, 181\u2013188 (1991)","journal-title":"Inform. Process. Lett."},{"key":"38_CR7","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":"38_CR8","doi-asserted-by":"publisher","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\u00a032, 130\u2013136 (1985)","journal-title":"J. ACM"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1137\/S0895480191218861","volume":"8","author":"H.A. Kierstead","year":"1995","unstructured":"Kierstead, H.A., Qin, J.: Coloring interval graphs with First-Fit. SIAM J. Discrete Math.\u00a08, 47\u201357 (1995)","journal-title":"SIAM J. Discrete Math."},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Meyerson, A.: Online facility location. In: Proc. 42nd IEEE Sympos. Found. Comput. Sci., pp. 426\u2013433 (2001)","DOI":"10.1109\/SFCS.2001.959917"},{"key":"38_CR11","doi-asserted-by":"publisher","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. Theoret. Comput. Sci.\u00a0246, 53\u201372 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"38_CR12","unstructured":"Tanimoto, S.L., Fowler, R.J.: Covering image subsets with patches. In: Proc. 5th International Conf. on Pattern Recognition, pp. 835\u2013839 (1980)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:17:56Z","timestamp":1619504276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735441","9783540735458"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}