{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:25Z","timestamp":1725558985000},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262244"},{"type":"electronic","value":"9783540324409"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496199_17","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T06:29:15Z","timestamp":1279088955000},"page":"142-150","source":"Crossref","is-referenced-by-count":0,"title":["Facility Location in a Global View"],"prefix":"10.1007","author":[{"given":"Wenqiang","family":"Dai","sequence":"first","affiliation":[]},{"given":"Peng","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Ke","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"17_CR1","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/299917.299918","volume":"30","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., Sharir, M.: Efficient Algorithms for Geometric Optimization. ACM Computing Surveys\u00a030(4), 412\u2013458 (1998)","journal-title":"ACM Computing Surveys"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/3-540-69346-7_14","volume-title":"Integer Programming and Combinatorial Optimization","author":"F. Chudak","year":"1998","unstructured":"Chudak, F.: Improved algorithms for uncapacitated facility location problem. In: Bixby, R.E., Boyd, E.A., R\u00edos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol.\u00a01412, pp. 180\u2013194. Springer, Heidelberg (1998)"},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/978-3-642-56082-8_3","volume-title":"Facility Location: Applications and Theory","author":"J. Current","year":"2002","unstructured":"Current, J., Daskin, M., Schilling, D.: Discrete network location models. In: Drezner, Z., Hammacher, H.W. (eds.) Facility Location: Applications and Theory, pp. 81\u2013118. Springer, Heidelberg (2002)"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/S0377-2217(97)00303-2","volume":"110","author":"J. Current","year":"1998","unstructured":"Current, J., Ratick, S., Revelle, C.: Dynamic facility location when the total number of facilities is uncertain: a decision analysis approach. European Journal of Operation Research\u00a0110(3), 597\u2013609 (1998)","journal-title":"European Journal of Operation Research"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for facility location and k\u2009\u2212median problems. In: Proc. FOCS 1999, pp. 378\u2013388 (1999)","DOI":"10.1109\/SFFCS.1999.814609"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Chudak, F., Shmoys, D.B.: Improved approximation algorithms for capacitated facility location problem. In: Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (1999)","DOI":"10.1007\/3-540-48777-8_8"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-540-27810-8_10","volume-title":"Algorithm Theory - SWAT 2004","author":"R. Fleischer","year":"2004","unstructured":"Fleischer, R., Golin, M.J., Yan, Z.: Online Maintenance of k\u2009\u2212medians and k\u2009\u2212covers on a line. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 102\u2013113. Springer, Heidelberg (2004)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. In: Proc. of the 9th ACM-SIAM Symposium on Discrete Algorithms (1998): Also in Journal of Algorithms\u00a031, 228\u2013248 (1999)","DOI":"10.1006\/jagm.1998.0993"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.: Primal-dual approximation algorithms for metric facility location and k\u2009\u2212median problems. In: Proc. FOCS 1999 (1999)","DOI":"10.1109\/SFFCS.1999.814571"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-45753-4_20","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M. Mahdian","year":"2002","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 229\u2013242. Springer, Heidelberg (2002)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Mettu, R.R., Plaxton, C.G.: The online median problem. In: Proc. FOCS 2000, pp. 339\u2013348 (2000)","DOI":"10.1109\/SFCS.2000.892122"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Plaxton, C.G.: Approximation algorithms for hierarchical location problems. In: Proc. STOC 2003, pp. 40\u201349 (2003)","DOI":"10.1145\/780542.780549"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-44968-X_32","volume-title":"Computing and Combinatorics","author":"Z. Qin","year":"2000","unstructured":"Qin, Z., Xu, Y., Zhu, B.: On some optimization problems in obnoxious facility location. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol.\u00a01858, pp. 320\u2013329. Springer, Heidelberg (2000)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-44436-X_4","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"D.B. Shmoys","year":"2000","unstructured":"Shmoys, D.B.: Approximation algorithms for facility location problems. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol.\u00a01913, pp. 27\u201333. Springer, Heidelberg (2000)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems. In: Proc. STOC 1997, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/3-540-47867-1_18","volume-title":"Integer Programming and Combinatorial Optimization","author":"M. Sviridenko","year":"2002","unstructured":"Sviridenko, M.: An 1.528-approximation algorithm for the metric uncapacitated facility location problem. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, p. 240. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Applications in Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496199_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:00:11Z","timestamp":1605625211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496199_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262244","9783540324409"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11496199_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}