{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T10:25:51Z","timestamp":1751451951557},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,2,1]],"date-time":"2014-02-01T00:00:00Z","timestamp":1391212800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s11432-014-5065-0","type":"journal-article","created":{"date-parts":[[2014,3,7]],"date-time":"2014-03-07T05:50:00Z","timestamp":1394171400000},"page":"1-7","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A 16-competitive algorithm for hierarchical median problem"],"prefix":"10.1007","volume":"57","author":[{"given":"WenQiang","family":"Dai","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,15]]},"reference":[{"key":"5065_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032343","volume-title":"Network and Discrete Location: Models, Algorithms, and Applications","author":"M S Daskin","year":"1995","unstructured":"Daskin M S. Network and Discrete Location: Models, Algorithms, and Applications. New York: Wiley, 1995"},{"key":"5065_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56082-8","volume-title":"Facility Location: Applications and Theory","author":"Z Drezner","year":"2002","unstructured":"Drezner Z, Hamacher H. Facility Location: Applications and Theory. Berlin: Springer, 2002"},{"key":"5065_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-7572-0","volume-title":"Foundations of Location Analysis","author":"H A Eiselt","year":"2011","unstructured":"Eiselt H A, Marianov V. Foundations of Location Analysis. Berlin: Springer, 2011"},{"key":"5065_CR4","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1137\/07068151X","volume":"37","author":"V Arya","year":"2008","unstructured":"Arya V, Garg N, Khandekar R, et al. Local search heuristics for k-median and facility location problems. SIAM J Comput, 2008, 37: 1472\u20131498","journal-title":"SIAM J Comput"},{"key":"5065_CR5","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","volume":"179","author":"N Mladenovi\u0107","year":"2007","unstructured":"Mladenovi\u0107 N, Brimberg J, Hansen P, et al. The p-median problem: a survey of metaheuristic approaches. Eur J Oper Res, 2007, 179: 927\u2013939","journal-title":"Eur J Oper Res"},{"key":"5065_CR6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/3-540-44436-X_4","volume-title":"Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization, Saarbr\u00fccken","author":"D B Shmoys","year":"2000","unstructured":"Shmoys D B. Approximation algorithms for facility location problems. In: Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization, Saarbr\u00fccken, 2000. 27\u201333"},{"key":"5065_CR7","doi-asserted-by":"crossref","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. J Comput Syst Sci, 2006, 72: 425\u2013443","journal-title":"J Comput Syst Sci"},{"key":"5065_CR8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s10479-007-0174-4","volume":"153","author":"J P Barth\u00e9lemy","year":"2007","unstructured":"Barth\u00e9lemy J P, Brucker F, Osswald C. Combinatorial optimization and hierarchical classifications. Ann Oper Res, 2007, 153: 179\u2013214","journal-title":"Ann Oper Res"},{"key":"5065_CR9","doi-asserted-by":"crossref","first-page":"3633","DOI":"10.1137\/070698257","volume":"3","author":"G L Lin","year":"2010","unstructured":"Lin G L, Nagarajan C, Rajamaran R, et al. A general approach for incremental approximation and hierarchical clustering. SIAM J Comput, 2010, 3: 3633\u20133669","journal-title":"SIAM J Comput"},{"key":"5065_CR10","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1134\/S1990478909010141","volume":"3","author":"V V Shenmaier","year":"2009","unstructured":"Shenmaier V V. An approximation algorithm for the hierarchical median problem. J Appl Ind Math, 2009, 3: 128\u2013132","journal-title":"J Appl Ind Math"},{"key":"5065_CR11","doi-asserted-by":"crossref","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, 2003, 32: 816\u2013832","journal-title":"SIAM J Comput"},{"key":"5065_CR12","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1016\/j.tcs.2009.07.006","volume":"412","author":"M Chrobak","year":"2011","unstructured":"Chrobak M, Hurand M. Better bounds for incremental medians. Theor Comput Sci, 2011, 412: 594\u2013601","journal-title":"Theor Comput Sci"},{"key":"5065_CR13","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s00453-007-9005-x","volume":"50","author":"M Chrobak","year":"2008","unstructured":"Chrobak M, Kenyon C, Noga J, et al. Incremental medians via online bidding. Algorithmica, 2008, 50: 455\u2013478","journal-title":"Algorithmica"},{"key":"5065_CR14","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10878-009-9219-8","volume":"20","author":"W Q Dai","year":"2010","unstructured":"Dai W Q, Zeng X J. Incremental facility location problem and its competitive algorithms. J Comb Optim, 2010, 20: 307\u2013320","journal-title":"J Comb Optim"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-014-5065-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-014-5065-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-014-5065-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:37:56Z","timestamp":1559403476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-014-5065-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["5065"],"URL":"https:\/\/doi.org\/10.1007\/s11432-014-5065-0","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2]]}}}