{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:35:48Z","timestamp":1774416948176,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540695134","type":"print"},{"value":"9783540695141","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/11970125_10","type":"book-chapter","created":{"date-parts":[[2007,1,24]],"date-time":"2007-01-24T00:47:40Z","timestamp":1169599660000},"page":"121-131","source":"Crossref","is-referenced-by-count":6,"title":["A Randomized Algorithm for Online Unit Clustering"],"prefix":"10.1007","author":[{"given":"Timothy M.","family":"Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid","family":"Zarrabi-Zadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24592-6_1","volume-title":"Approximation and Online Algorithms","author":"U. Adamy","year":"2004","unstructured":"Adamy, U., Erlebach, T.: Online coloring of intervals with bandwidth. In: Solis-Oba, R., Jansen, K. (eds.) WAOA 2003. LNCS, vol.\u00a02909, pp. 1\u201312. Springer, Heidelberg (2004)"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., van Kreveld, M., Suri, S.: Label placement by maximum independent set in rectangles. Comput. Geom. Theory Appl.\u00a011, 209\u2013218 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/S0196-6774(02)00294-8","volume":"46","author":"T.M. Chan","year":"2003","unstructured":"Chan, T.M.: Polynomial-time approximation schemes for packing and piercing fat objects. J. Algorithms\u00a046, 178\u2013189 (2003)","journal-title":"J. Algorithms"},{"issue":"6","key":"10_CR4","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":"10_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M., O\u2019Callaghan, L., Panigrahy, R.: Better streaming algorithms for clustering problems. In: Proc. 35th ACM Sympos. Theory Comput., pp. 30\u201339 (2003)","DOI":"10.1145\/780547.780548"},{"key":"10_CR6","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":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/11523468_49","volume-title":"Automata, Languages and Programming","author":"L. Epstein","year":"2005","unstructured":"Epstein, L., Levy, M.: Online interval coloring and variants. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 602\u2013613. Springer, Heidelberg (2005)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1137\/S0097539702402676","volume":"34","author":"T. Erlebach","year":"2005","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric intersection graphs. SIAM J. Comput.\u00a034, 1302\u20131323 (2005)","journal-title":"SIAM J. Comput."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Feder, T., Greene, D.H.: Optimal algorithms for approximate clustering. In: Proc. 20th ACM Sympos. Theory Comput., pp. 434\u2013444 (1988)","DOI":"10.1145\/62212.62255"},{"issue":"3","key":"10_CR10","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":"10_CR11","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":"10_CR12","unstructured":"Guha, S., Mishra, N., Motwani, R., O\u2019Callaghan, L.: Clustering data streams. In: Proc. 41st IEEE Sympos. Found. Comput. Sci., pp. 359\u2013366 (2000)"},{"key":"10_CR13","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":"10_CR14","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maas, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM\u00a032, 130\u2013136 (1985)","journal-title":"J. ACM"},{"key":"10_CR15","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":"10_CR16","first-page":"143","volume":"33","author":"H.A. Kierstead","year":"1981","unstructured":"Kierstead, H.A., Trotter, W.A.: An extremal problem in recursive combinatorics. Congressus Numerantium\u00a033, 143\u2013153 (1981)","journal-title":"Congressus Numerantium"},{"key":"10_CR17","unstructured":"Lipton, R.J., Tomkins, A.: Online interval scheduling. In: Proc. 5th Sympos. Discrete Algorithms, pp. 302\u2013311 (1994)"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"M.V. Marathe","year":"1995","unstructured":"Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks\u00a025, 59\u201368 (1995)","journal-title":"Networks"},{"issue":"1","key":"10_CR19","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1137\/0213014","volume":"13","author":"N. Megiddo","year":"1984","unstructured":"Megiddo, N., Supowit, K.J.: On the complexity of some common geometric location problems. SIAM J. Comput.\u00a013(1), 182\u2013196 (1984)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11970125_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:23:46Z","timestamp":1619493826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11970125_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540695134","9783540695141"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11970125_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}