{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:20:27Z","timestamp":1743157227974,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642206610"},{"type":"electronic","value":"9783642206627"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20662-7_15","type":"book-chapter","created":{"date-parts":[[2011,4,20]],"date-time":"2011-04-20T06:05:25Z","timestamp":1303279525000},"page":"169-180","source":"Crossref","is-referenced-by-count":2,"title":["An Experimental Evaluation of Incremental and Hierarchical k-Median Algorithms"],"prefix":"10.1007","author":[{"given":"Chandrashekhar","family":"Nagarajan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David P.","family":"Williamson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/A:1026130003508","volume":"122","author":"O. Alp","year":"2003","unstructured":"Alp, O., Erkut, E., Drezner, D.: An efficient genetic algorithm for the p-median problem. Annals of Operations Research\u00a0122, 21\u201342 (22) (2003)","journal-title":"Annals of Operations Research"},{"key":"15_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, 544\u2013562 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0377-2217(85)90040-2","volume":"21","author":"J.E. Beasley","year":"1985","unstructured":"Beasley, J.E.: A note on solving large p-median problems. European Journal of Operational Research\u00a021, 270\u2013273 (1985)","journal-title":"European Journal of Operational Research"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S., Tardos, E., Shmoys, D.B.: A constant-factor approximation algorithm for the k-median problem (extended abstract). In: Proceedings of the 31th Annual ACM Symposium on Theory of Computing, pp. 1\u201310 (1999)","DOI":"10.1145\/301250.301257"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s00453-007-9005-x","volume":"50","author":"M. Chrobak","year":"2008","unstructured":"Chrobak, M., Kenyon, C., Noga, J., Young, N.E.: Incremental medians via online bidding. Algorithmica\u00a050, 455\u2013478 (2008)","journal-title":"Algorithmica"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/0377-2217(94)00159-6","volume":"88","author":"R.D. Galvao","year":"1996","unstructured":"Galvao, R.D., ReVelle, C.: A Lagrangean heuristic for the maximal covering location problem. European Journal of Operational Research\u00a088(1), 114\u2013123 (1996)","journal-title":"European Journal of Operational Research"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K. Jain","year":"2003","unstructured":"Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual-fitting with factor-revealing LP. Journal of the ACM\u00a050, 795\u2013824 (2003)","journal-title":"Journal of the ACM"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithm approach to network location problems ii. the p-medians. SIAM Journal of Applied Mathematics\u00a037, 539\u2013560 (1979)","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"3633","DOI":"10.1137\/070698257","volume":"39","author":"G. Lin","year":"2010","unstructured":"Lin, G., Nagarajan, C., Rajaraman, R., Williamson, D.P.: A general approach for incremental approximation and hierarchical clustering. SIAM Journal on Computing\u00a039, 3633\u20133669 (2010)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR10","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 Journal on Computing\u00a032, 816\u2013832 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.jcss.2005.09.004","volume":"72","author":"C.G. Plaxton","year":"2006","unstructured":"Plaxton, C.G.: Approximation algorithms for hierarchical location problems. Journal of Computer and System Sciences\u00a072, 425\u2013443 (2006)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20662-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:20:24Z","timestamp":1558570824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20662-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642206610","9783642206627"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20662-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}