{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:07:23Z","timestamp":1725502043846},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540779179"},{"type":"electronic","value":"9783540779186"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77918-6_17","type":"book-chapter","created":{"date-parts":[[2008,2,8]],"date-time":"2008-02-08T08:41:19Z","timestamp":1202460079000},"page":"207-217","source":"Crossref","is-referenced-by-count":1,"title":["Better Bounds for Incremental Medians"],"prefix":"10.1007","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathilde","family":"Hurand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","first-page":"21","volume-title":"STOC. Proc. 33rd Symp. Theory of Computing","author":"V. Arya","year":"2001","unstructured":"Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristic for k-median and facility location problems. In: STOC. Proc. 33rd Symp. Theory of Computing, pp. 21\u201329. ACM, New York (2001)"},{"issue":"3","key":"17_CR2","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/S0097539702416402","volume":"33","author":"V. Arya","year":"2004","unstructured":"Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM Journal on Computing\u00a033(3), 544\u2013562 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Kenyon, C.: Competitiveness via doubling. SIGACT News, 115\u2013126 (2006)","DOI":"10.1145\/1189056.1189078"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/11682462_31","volume-title":"LATIN 2006: Theoretical Informatics","author":"M. Chrobak","year":"2006","unstructured":"Chrobak, M., Kenyon, C., Noga, J., Young, N.: Online medians via online bidding. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 311\u2013322. Springer, Heidelberg (2006)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Lin, G., Nagarajan, C., Rajamaran, R., Williamson, D.P.: A general approach for incremental approximation and hierarchical clustering. In: SODA. Proc. 17th Symp. on Discrete Algorithms, pp. 1147\u20131156 (2006)","DOI":"10.1145\/1109557.1109684"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1109\/SFCS.2000.892122","volume-title":"FOCS. Proc. 41st Symp. Foundations of Computer Science","author":"R.R. Mettu","year":"2000","unstructured":"Mettu, R.R, Plaxton, C.G.: The online median problem. In: Ramgopal, R. (ed.) FOCS. Proc. 41st Symp. Foundations of Computer Science, pp. 339\u2013348. IEEE, Los Alamitos (2000)"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1137\/S0097539701383443","volume":"32","author":"R.R. Mettu","year":"2003","unstructured":"Mettu, R.R., Plaxton, C.G.: The online median problem. SIAM J. Comput.\u00a032, 816\u2013832 (2003)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77918-6_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:56:14Z","timestamp":1619520974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77918-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540779179","9783540779186"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77918-6_17","relation":{},"subject":[]}}