{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:08:51Z","timestamp":1759666131001,"version":"3.41.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1023\/a:1011465419252","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T10:16:33Z","timestamp":1040638593000},"page":"233-247","source":"Crossref","is-referenced-by-count":8,"title":["Approximation Algorithms for Bounded Facility Location Problems"],"prefix":"10.1007","volume":"5","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","reference":[{"key":"333488_CR1","doi-asserted-by":"crossref","unstructured":"S. Arora, P. Raghavan, and S. Rao, \u201cApproximation schemes for Euclidean k-medians and related problems,\u201d Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 106-113.","DOI":"10.1145\/276698.276718"},{"key":"333488_CR2","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1057\/jors.1991.69","volume":"42","author":"O. Berman","year":"1991","unstructured":"O. Berman and E.K. Yang, \u201cMedi-center location problems,\u201d Journal of the Operational Research Society, vol. 42, pp. 313-322, 1991.","journal-title":"Journal of the Operational Research Society"},{"key":"333488_CR3","unstructured":"M. Charikar, S. Guha, \u00c9. Tardos, and D.B. Shmoys, \u201cA constant-factor approximation algorithm for the k-median problem,\u201d in Proceedings of the 31st ACM Symposium on Theory of Computing, 1999."},{"key":"333488_CR4","doi-asserted-by":"crossref","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, \u201cThe p-neighbor k-center problem,\u201d Information Processing Letters, vol. 65, pp. 131-134, 1998.","journal-title":"Information Processing Letters"},{"key":"333488_CR5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1108\/01443579510098338","volume":"15","author":"S.S. Chaudhry","year":"1995","unstructured":"S.S. Chaudhry, I.C. Choi, and D.K. Smith, \u201cFacility location with and without maximum distance constraints through the p-median problem,\u201d International Journal of Operations and Production Management, vol. 15, pp. 75-81, 1995.","journal-title":"International Journal of Operations and Production Management"},{"key":"333488_CR6","first-page":"235","volume":"1","author":"I.C. Choi","year":"1993","unstructured":"I.C. Choi and S.S. Chaudhry, \u201cThe p-median problem with maximum distance constraints: A direct approach,\u201d Location Science, vol. 1, pp. 235-243, 1993.","journal-title":"Location Science"},{"key":"333488_CR7","doi-asserted-by":"crossref","unstructured":"F. Chudak, \u201cImproved approximation algorithms for uncapacitated facility location,\u201d in Integer Programming and Combinatorial Optimization, R.E. Bixby, E.A. Boyd, and R.Z. Rios-Mercado (Eds.), Lecture Notes in Computer Science, vol. 1412, 1998, pp. 180-194.","DOI":"10.1007\/3-540-69346-7_14"},{"key":"333488_CR8","first-page":"119","volume-title":"Discrete Location Theory","author":"G. Cornuejols","year":"1990","unstructured":"G. Cornuejols, G. L. Nemhauser, and L.A. Wolsey, \u201cThe uncapacitated facility location problem,\u201d in Discrete Location Theory, P.B. Mirchandani and R.L. Francis (Eds.), Wiley: New York, 1990, pp. 119-171."},{"volume-title":"Facility Location. A Survey of Applications and Methods","year":"1995","key":"333488_CR9","unstructured":"Z. Drezner (Ed.), Facility Location. A Survey of Applications and Methods, Springer-Verlag: New York, 1995."},{"key":"333488_CR10","unstructured":"S. Guha and S. Khuller, \u201cGreedy strikes back: Improved facility location algorithms,\u201d in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 649-657."},{"key":"333488_CR11","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/5925.5933","volume":"33","author":"D.S. Hochbaum","year":"1986","unstructured":"D.S. Hochbaum and D.B. Shmoys, \u201cA unified approach to approximation algorithms for bottleneck problems,\u201d Journal of the ACM, vol. 33, pp. 533-550, 1986.","journal-title":"Journal of the ACM"},{"key":"333488_CR12","volume-title":"Algorithms for Clustering Data","author":"A.K. Jain","year":"1981","unstructured":"A.K. Jain and R.C. Dubes, Algorithms for Clustering Data, Prentice Hall: Englewood, NJ 1981."},{"key":"333488_CR13","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0304-3975(98)00222-9","volume":"242","author":"S. Khuller","year":"2000","unstructured":"S. Khuller, R. Pless, and Y. J. Sussmann, \u201cFault Tolerant k-center problems,\u201d Theoretical Computer Science, vol. 242, pp. 237-245, 2000.","journal-title":"Theoretical Computer Science"},{"key":"333488_CR14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1111\/j.1538-4632.1973.tb00493.x","volume":"5","author":"B.M. Khumawala","year":"1973","unstructured":"B.M. Khumawala, \u201cAn efficient algorithm for the p-median problem with maximum distance constraint,\u201d Geographical Analysis, vol. 5, pp. 309-321, 1973.","journal-title":"Geographical Analysis"},{"key":"333488_CR15","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/ISCAS.1999.780109","volume":"VI","author":"G. Lin","year":"1999","unstructured":"G. Lin and G. Xue, \u201cBalancing shortest-path trees and Steiner minimum trees in the rectilinear plane,\u201d in Proceedings of the 1999 IEEE International Symposium on Circuits and Systems (ISCAS'99), pp. 117-120, vol. VI, 1999.","journal-title":"Proceedings of the 1999 IEEE International Symposium on Circuits and Systems (ISCAS'99)"},{"key":"333488_CR16","doi-asserted-by":"crossref","unstructured":"J.H. Lin and J.S. Vitter, \u201c\u2208-Approximations with minimum packing constraint violation,\u201d in Proceedings 24th ACM Symposium on Theory of Computing, 1992a, pp. 771-782.","DOI":"10.1145\/129712.129787"},{"key":"333488_CR17","doi-asserted-by":"crossref","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, \u201cApproximation algorithms for geometric median problems,\u201d Information Processing Letters, vol. 44, pp. 245-249, 1992b.","journal-title":"Information Processing Letters"},{"key":"333488_CR18","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1006\/jagm.1998.0930","volume":"28","author":"M.V. Marathe","year":"1998","unstructured":"M.V. Marathe, R. Ravi, R. Sundaram, S.S. Ravi, D.J. Rosenkrantz, and H.B. Hunt III, \u201cBicriteria network design problems,\u201d Journal of Algorithms, vol. 28, pp. 142-171, 1998.","journal-title":"Journal of Algorithms"},{"key":"333488_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, New York, 1995."},{"key":"333488_CR20","doi-asserted-by":"crossref","unstructured":"D.B. Shmoys, \u00c9. Tardos, and K. Aardal, \u201cApproximation algorithms for facility location problems,\u201d in Proceedings of the 29th ACM Symposium on Theory of Computing, 1997, pp. 265-274.","DOI":"10.1145\/258533.258600"},{"key":"333488_CR21","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1287\/opre.19.6.1363","volume":"19","author":"C. Toregas","year":"1971","unstructured":"C. Toregas, R. Swain, C. ReVelle, and L. Bergman, \u201cThe location of emergency service facilities,\u201d Operations Research, vol. 19, pp. 1363-1373, 1971.","journal-title":"Operations Research"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011465419252.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011465419252\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011465419252.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:15:19Z","timestamp":1751282119000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011465419252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["333488"],"URL":"https:\/\/doi.org\/10.1023\/a:1011465419252","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}