{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:11:09Z","timestamp":1725567069714},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_65","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"644-653","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Approximation Algorithm for Uncapacitated Facility Location Problem with Penalties"],"prefix":"10.1007","author":[{"given":"Guang","family":"Xu","sequence":"first","affiliation":[]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"65_CR1","doi-asserted-by":"crossref","unstructured":"Arya, V., Garg, N., Meyerson, A., Munagala, K., Pandit, V.: Local Search Heuristics for k-median and Facility Location Problems. In: Proc. 33rd ACM Symposium on Theory of Computing, pp. 21\u201329 (2001)","DOI":"10.1145\/380752.380755"},{"key":"65_CR2","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for facility location and k-median problems. In: Proc. 39th IEEE Symposium on Foundations of Computer Science, pp. 378\u2013388 (1999)","DOI":"10.1109\/SFFCS.1999.814609"},{"key":"65_CR3","unstructured":"Charikar, M., Khuller, S., Mount, D., Narasimhan, G.: Algorithms for Facility Location Problems with Outliers. In: Proc. Symposium on Discrete Algorithms, pp. 642\u2013651 (2001)"},{"key":"65_CR4","doi-asserted-by":"crossref","unstructured":"Chudak, F., Shmoys, D.: Improved approximation algorithms for a capacitated facility location problem. In: Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 875\u2013876 (1999)","DOI":"10.1007\/3-540-48777-8_8"},{"key":"65_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/3-540-48777-8_8","volume-title":"Integer Programming and Combinatorial Optimization","author":"F.A. Chudak","year":"1999","unstructured":"Chudak, F.A., Williamson, D.P.: Improved Approximation Algorithms for Capacitated Facility Location Problems. In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol.\u00a01610, pp. 99\u2013113. Springer, Heidelberg (1999)"},{"issue":"1","key":"65_CR6","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S. Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. J. Algorithms\u00a031(1), 228\u2013248 (1999)","journal-title":"J. Algorithms"},{"issue":"2","key":"65_CR7","doi-asserted-by":"publisher","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.: A constant factor approximation algorithm for the fault-tolerant facility location problem. J. Algorithms\u00a048(2), 429\u2013440 (2003)","journal-title":"J. Algorithms"},{"issue":"2","key":"65_CR8","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K. Jain","year":"2001","unstructured":"Jain, K., Vazirzni, V.: Approximation Algorithms for Metric Facility Location and k-Median Problems Using the Primal-Dual Schema and Lagrangian Relaxation. J. ACM\u00a048(2), 274\u2013296 (2001)","journal-title":"J. ACM"},{"issue":"6","key":"65_CR9","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":"65_CR10","unstructured":"Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. In: Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1\u201310 (1998)"},{"key":"65_CR11","doi-asserted-by":"crossref","unstructured":"Lin, J.H., Vitter, J.S.: \u03b5-approximation with minimum packing constraint violation. In: Proceddings of the 24th Annual ACM Symposium on Theory of Computing, pp. 771\u2013782 (1992)","DOI":"10.1145\/129712.129787"},{"key":"65_CR12","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":"65_CR13","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, \u00c9., Aardal, K.: Approximation algorithms for facility location problems. In: Proc. 29th ACM Symposium on Theory of Computing, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"issue":"3","key":"65_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.ipl.2005.01.005","volume":"94","author":"G. Xu","year":"2005","unstructured":"Xu, G., Xu, J.: An LP Rounding Algorithm for Approximating Uncapacitated Facility Location Problem with Penalties. Inform. Proc. Lett.\u00a094(3), 119\u2013123 (2005)","journal-title":"Inform. Proc. Lett."},{"key":"65_CR15","unstructured":"Zhang, J.: Approximating the two-level facility location problem via a quasi-greedy approach. In: Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 808\u2013817 (2004)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T22:37:04Z","timestamp":1586471824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11533719_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}