{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T22:38:11Z","timestamp":1775083091478,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,1,26]],"date-time":"2008-01-26T00:00:00Z","timestamp":1201305600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1007\/s10878-007-9127-8","type":"journal-article","created":{"date-parts":[[2008,1,25]],"date-time":"2008-01-25T16:25:42Z","timestamp":1201278342000},"page":"424-436","source":"Crossref","is-referenced-by-count":50,"title":["An improved approximation algorithm for uncapacitated facility location problem with penalties"],"prefix":"10.1007","volume":"17","author":[{"given":"Guang","family":"Xu","sequence":"first","affiliation":[]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,1,26]]},"reference":[{"key":"9127_CR1","doi-asserted-by":"crossref","unstructured":"Arya V, Garg N, Meyerson A, Munagala K, Pandit V (2001) Local search heuristics for k-median and facility location problems. In: Proceedings of the 33rd ACM symposium on theory of computing, pp\u00a021\u201329","DOI":"10.1145\/380752.380755"},{"key":"9127_CR2","doi-asserted-by":"crossref","unstructured":"Charikar M, Guha S (1999) Improved combinatorial algorithms for facility location and k-median problems. In: Proceedings of the 39th IEEE symposium on foundations of computer science, pp 378\u2013388","DOI":"10.1109\/SFFCS.1999.814609"},{"key":"9127_CR3","unstructured":"Charikar M, Khuller S, Mount D, Narasimhan G (2001) Algorithms for facility location problems with outliers. In: Proceedings of the symposium on discrete algorithms, pp 642\u2013651"},{"key":"9127_CR4","doi-asserted-by":"crossref","unstructured":"Chudak F, Shmoys D (1999) Improved approximation algorithms for a capacitated facility location problem. In: Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms, pp 875\u2013876","DOI":"10.1007\/3-540-48777-8_8"},{"key":"9127_CR5","first-page":"99","volume-title":"Lecture notes in computer science","author":"F Chudak","year":"1999","unstructured":"Chudak F, Williamson DP (1999) Improved approximation algorithms for capacitated facility location problems. In: Lecture notes in computer science, vol 1610. Springer, Berlin, pp 99\u2013113"},{"issue":"1","key":"9127_CR6","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S Guha","year":"1999","unstructured":"Guha S, Khuller S (1999) Greedy strikes back: improved facility location algorithms. J Algorithms 31(1):228\u2013248","journal-title":"J Algorithms"},{"issue":"2","key":"9127_CR7","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/S0196-6774(03)00056-7","volume":"48","author":"S Guha","year":"2003","unstructured":"Guha S, Meyerson A, Munagala K (2003) A constant factor approximation algorithm for the fault-tolerant facility location problem. J Algorithms 48(2):429\u2013440","journal-title":"J Algorithms"},{"issue":"2","key":"9127_CR8","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K Jain","year":"2001","unstructured":"Jain K, Vazirzni V (2001) Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J ACM 48(2):274\u2013296","journal-title":"J ACM"},{"issue":"6","key":"9127_CR9","doi-asserted-by":"crossref","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 (2003) Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J ACM 50(6):795\u2013824","journal-title":"J ACM"},{"key":"9127_CR10","unstructured":"Korupolu MR, Plaxton CG, Rajaraman R (1998) 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"},{"key":"9127_CR11","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/3-540-44436-X_4","volume-title":"Approximation algorithms for combinatorial optimization","author":"DB Shmoys","year":"2000","unstructured":"Shmoys DB (2000) Approximation algorithms for facility location problem. In: Jansen K, Khuller S (eds) Approximation algorithms for combinatorial optimization. Lecture notes in computer science, vol\u00a01913, pp 27\u201333. Springer, Berlin,"},{"key":"9127_CR12","unstructured":"Shmoys DB, Tardos \u00c9, Aardal K (1997) Approximation algorithms for facility location problems. In: Proceedings of the 29th ACM symposium on theory of computing, pp 265\u2013274"},{"issue":"3","key":"9127_CR13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.ipl.2005.01.005","volume":"94","author":"G Xu","year":"2005","unstructured":"Xu G, Xu J (2005) An LP Rounding Algorithm for approximating uncapacitated facility location problem with penalties. Inf Process Lett 94(3):119\u2013123","journal-title":"Inf Process Lett"},{"key":"9127_CR14","unstructured":"Zhang J (2004) Approximating the two-level facility location problem via a quasi-greedy approach, In: Proceedings of the 15th annual ACM-SIAM symposium on discrete algorithms, pp 808\u2013817"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9127-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9127-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9127-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:12Z","timestamp":1559276292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9127-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,26]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["9127"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9127-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,26]]}}}