{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:36:44Z","timestamp":1742996204689,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540899846"},{"type":"electronic","value":"9783540899853"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89985-3_6","type":"book-chapter","created":{"date-parts":[[2008,11,21]],"date-time":"2008-11-21T22:39:50Z","timestamp":1227307190000},"page":"41-49","source":"Crossref","is-referenced-by-count":4,"title":["An Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem with Penalties"],"prefix":"10.1007","author":[{"given":"Mohsen","family":"Asadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Niknafs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Ghodsi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"6_CR1","doi-asserted-by":"publisher","first-page":"2310","DOI":"10.1016\/j.cor.2005.09.005","volume":"34","author":"G. Sahin","year":"2007","unstructured":"Sahin, G., Sural, H.: A review of hierarchical facility location models. J. Computers & Operations Research\u00a034(8), 2310\u20132331 (2007)","journal-title":"J. Computers & Operations Research"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/380752.380755","volume-title":"Proceedings of the Thirty-Third Annual ACM Symposium on theory of Computing (STOC 2001)","author":"V. Arya","year":"2001","unstructured":"Arya, V., Garg, N., Khandekar, R., Munagala, K., Pandit, V.: Local search heuristic for -median and facility location problems. In: Proceedings of the Thirty-Third Annual ACM Symposium on theory of Computing (STOC 2001), Hersonissos, Greece, pp. 21\u201329. ACM Press, New York (2001)"},{"key":"6_CR3","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. Shmoys","year":"2000","unstructured":"Shmoys, D.: Approximation Algorithms For Facility Location Problems. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol.\u00a01913, pp. 27\u201332. Springer, Heidelberg (2000)"},{"issue":"6","key":"6_CR4","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.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM\u00a050(6), 795\u2013824 (2003)","journal-title":"J. ACM"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Xu, G., Xu, J.: An LP rounding algorithm for approximating uncapacitated facility location problem with penalties. J. Information Processing Letters (94), 119\u2013123 (2005)","DOI":"10.1016\/j.ipl.2005.01.005"},{"key":"6_CR6","unstructured":"Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1\u201310 (1998)"},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/j.orl.2005.06.002","volume":"34","author":"D. Xu","year":"2006","unstructured":"Xu, D., Du, D.: The -level facility location game. J. Operations Research Letters\u00a034(4), 421\u2013426 (2006)","journal-title":"J. Operations Research Letters"},{"issue":"5-6","key":"6_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0020-0190(99)00144-1","volume":"72","author":"K. Aardal","year":"1999","unstructured":"Aardal, K., Chudak, F.A., Shmoys, D.B.: A 3-approximation algorithm for the k-level uncapacitated facility location problem. J. Information Processing Letters\u00a072(5-6), 161\u2013167 (1999)","journal-title":"J. Information Processing Letters"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. J. ACM (48), 274\u2013296 (2001)","DOI":"10.1145\/375827.375845"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11750321_21","volume-title":"Theory and Applications of Models of Computation","author":"P. Zhang","year":"2006","unstructured":"Zhang, P.: A new approximation algorithm for the k-facility Location Problem. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol.\u00a03959, pp. 217\u2013230. Springer, Heidelberg (2006)"},{"key":"6_CR11","unstructured":"Charikar, M., Khuller, S., Mount, D., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proceedings of Symposium on Discrete Algorithms, pp. 642\u2013651 (2001)"}],"container-title":["Communications in Computer and Information Science","Advances in Computer Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89985-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T13:08:33Z","timestamp":1557925713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89985-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540899846","9783540899853"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89985-3_6","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2008]]}}}