{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:09:30Z","timestamp":1761620970646},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540645900"},{"type":"electronic","value":"9783540693468"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-69346-7_14","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T15:51:29Z","timestamp":1186069889000},"page":"180-194","source":"Crossref","is-referenced-by-count":67,"title":["Improved Approximation Algorithms for Uncapacitated Facility Location"],"prefix":"10.1007","author":[{"given":"Fabi\u00e1n A.","family":"Chudak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1998,6,18]]},"reference":[{"key":"14_CR1","unstructured":"A. A. Ageev and M. I. Sviridenko. An approximation algorithm for the uncapacitated facility location problem. Manuscript, 1997."},{"issue":"3","key":"14_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1287\/mnsc.12.3.253","volume":"12","author":"M. L. Balinski","year":"1965","unstructured":"M. L. Balinski. Integer programming: Methods, uses, computation. Management Science, 12(3):253\u2013313, 1965.","journal-title":"Management Science"},{"issue":"8","key":"14_CR3","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G. Cornu\u00e9jols","year":"1977","unstructured":"G. Cornu\u00e9jols, M. L. Fisher, and G. L. Nemhauser. Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Science, 23(8):789\u2013810, 1977.","journal-title":"Management Science"},{"key":"14_CR4","first-page":"119","volume-title":"Discrete Location Theory","author":"G. Cornu\u00e9jols","year":"1997","unstructured":"G. Cornu\u00e9jols, G. L. Nemhauser, and L. A. Wolsey. The uncapacitated facility location problem. In P. Mirchandani and R. Francis, editors, Discrete Location Theory, pages 119\u2013171. John Wiley and Sons, Inc., New York, 1997."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"U. Feige. A threshold of ln n for approxiamting set-cover. In 28th ACM Symposium on Theory of Computing, pages 314\u2013318, 1996.","DOI":"10.1145\/237814.237977"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/S0895480192243516","volume":"7","author":"M. X. Goemans","year":"1994","unstructured":"M. X. Goemans and D. P. Williamson. New 3\/4-approximation algorithms for max-sat. SIAM Journal on Discrete Mathematics, 7:656\u2013666, 1994.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"S. Guha and S. Khuller. Greedy strikes back: improved facility location algorithms. In Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1998. To appear.","DOI":"10.1006\/jagm.1998.0993"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"J. H. Lin and J. S. Vitter. \u2208-Approximation with minimum packing constraint violation. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 771\u2013782, 1992.","DOI":"10.1145\/129712.129787"},{"volume-title":"Discrete Location Theory","year":"1990","key":"14_CR9","unstructured":"P. Mirchandani and R. Francis, editors. Discrete Location Theory. John Wiley and Sons, Inc., New York, 1990."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"P. Raghavan and C. D. Thompson. Randomized rounding. Combinatorica, 7:365\u2013374, 1987.","journal-title":"Combinatorica"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"D. B. Shmoys, \u00c9. Tardos, and K. Aardal. Approximation algorithms for facility location problems. In 29th ACM Symposium on Theory of Computing, pages 265\u2013274, 1997.","DOI":"10.1145\/258533.258600"},{"key":"14_CR12","unstructured":"M. I. Sviridenko. Personal communication, July 1997."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69346-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:06:20Z","timestamp":1556733980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69346-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645900","9783540693468"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-69346-7_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}