{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:10:19Z","timestamp":1737288619156,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662006"},{"type":"electronic","value":"9783540486862"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48686-0_24","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:54:12Z","timestamp":1184601252000},"page":"241-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for Bounded Facility Location"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Krysta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Solis-Oba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,25]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"S. Arora, P. Raghavan and S. Rao, Approximation schemes for Euclidean k-medians and related problems, Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 106\u2013113, 1998.","DOI":"10.1145\/276698.276718"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1038\/sj\/jors\/0420405","volume":"42","author":"O. Berman","year":"1991","unstructured":"O. Berman and E.K. Yang, Medi-center location problems, Journal of the Operational Research Society, 42, 313\u2013322, 1991.","journal-title":"Journal of the Operational Research Society"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"M. Charikar, Ch. Chekuri, A. Goel and S. Guha, Rounding via trees: deterministic approximation algorithms for group steiner trees and k-median, Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 114\u2013123, 1998.","DOI":"10.1145\/276698.276719"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"M. Charikar, S. Guha, \u00c9. Tardos, and D.B. Shmoys, A constant-factor approximation algorithm for the k-median problem, to appear in the Proceedings of the 31st ACM Symposium on Theory of Computing, 1999.","DOI":"10.1145\/301250.301257"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0020-0190(97)00224-X","volume":"65","author":"S. Chaudhuri","year":"1998","unstructured":"S. Chaudhuri, N. Garg and R. Ravi, The p-neighbor k-center problem, Information Processing Letters, 65, 131\u2013134, 1998.","journal-title":"Information Processing Letters"},{"key":"24_CR6","first-page":"235","volume":"1","author":"I.C. Choi","year":"1993","unstructured":"I.C. Choi and S.S. Chaudhry, The p-median problem with maximum distance constraints: a direct approach, Location Science, 1, 235\u2013243, 1993.","journal-title":"Location Science"},{"key":"24_CR7","series-title":"Lect Notes Comput Sci","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":"F. Chudak, Improved approximation algorithms for uncapacitated facility location, in Integer Programming and Combinatorial Optimization, volume 1412 of Lecture Notes in Computer Science, 180\u2013194, 1998."},{"key":"24_CR8","first-page":"119","volume-title":"Discrete Location Theory","author":"G. Cornuejols","year":"1990","unstructured":"G. Cornuejols, G.L. Nemhauser, and L.A. Wolsey, The uncapacitated facility location problem, in Discrete Location Theory (Mirchandani and Francis, editors), Wiley, New York, pp. 119\u2013171, 1990."},{"volume-title":"Facility location. A survey of applications and methods","year":"1995","key":"24_CR9","unstructured":"Z. Drezner, editor, Facility location. A survey of applications and methods, Springer-Verlag, New York, 1995."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"U. Feige, A threshold of ln n for approximating set cover, Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 314\u2013318, 1996.","DOI":"10.1145\/237814.237977"},{"key":"24_CR11","unstructured":"S. Guha and S. Khuller, Greedy strikes back: improved facility location algorithms, Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 649\u2013657, 1998."},{"key":"24_CR12","volume-title":"Approximation Algorithms for NP-hard Problems","author":"D.S. Hochbaum","year":"1997","unstructured":"D.S. Hochbaum, Various notions of approximations: good, better, best, and more, in Approximation Algorithms for NP-hard Problems (D. Hochbaum, editor), PWS Company, Boston, 1997."},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/5925.5933","volume":"33","author":"D.S. Hochbaum","year":"1986","unstructured":"D.S. Hochbaum and D.B. Shmoys, A unified approach to approximation algorithms for bottleneck problems, Journal of the ACM, 33, 533\u2013550, 1986.","journal-title":"Journal of the ACM"},{"key":"24_CR14","unstructured":"A.K. Jain and R.C. Dubes, Algorithms for clustering data, Prentice Hall, 1981."},{"key":"24_CR15","unstructured":"S. Khuller, R. Pless and Y. J. Sussmann, Fault tolerant k-center problems, to appear in Theoretical Computer Science, 1999."},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"J.H. Lin and J.S. Vitter, \u2208-approximations with minimum packing constraint violation, Proceedings 24th ACM Symposium on Theory of Computing, 771\u2013782.","DOI":"10.1145\/129712.129787"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0020-0190(92)90208-D","volume":"44","author":"J.H. Lin","year":"1992","unstructured":"J.H. Lin and J.S. Vitter, Approximation algorithms for geometric median problems, Information Processing Letters, 44, 245\u2013249, 1992.","journal-title":"Information Processing Letters"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"D.B. Shmoys, \u00c9. Tardos, and K. Aardal, Approximation algorithms for facility location problems, Proceedings of the 29th ACM Symposium on Theory of Computing, 265\u2013274, 1997.","DOI":"10.1145\/258533.258600"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48686-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T11:42:56Z","timestamp":1737286976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48686-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662006","9783540486862"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48686-0_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"25 June 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}