{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T00:32:56Z","timestamp":1794357176231,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":57,"publisher":"Springer US","isbn-type":[{"value":"9780387307701","type":"print"},{"value":"9780387301624","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_139","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T14:35:59Z","timestamp":1214490959000},"page":"299-304","source":"Crossref","is-referenced-by-count":1,"title":["Facility Location"],"prefix":"10.1007","author":[{"given":"Karen","family":"Aardal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jaroslaw","family":"Byrka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad","family":"Mahdian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"139_CR1_139","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0020-0190(99)00144-1","volume":"72","author":"K. Aardal","year":"1999","unstructured":"Aardal, K., Chudak, F.A., Shmoys, D.B.: A\u00a03-approximation algorithm for the k-level uncapacitated facility location problem. Inf. Process. Lett. 72, 161\u2013167 (1999)","journal-title":"Inf. Process. Lett."},{"key":"139_CR2_139","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0166-218X(99)00103-1","volume":"93","author":"A.A. Ageev","year":"1999","unstructured":"Ageev, A.A., Sviridenko, M.I.: An 0.828-approximation algorithm for the uncapacitated facility location problem. Discret. Appl. Math. 93, 149\u2013156 (1999)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"139_CR3_139","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ic.2004.06.002","volume":"194","author":"A. Anagnostopoulos","year":"2004","unstructured":"Anagnostopoulos, A., Bent, R., Upfal, E., van Hentenryck, P.: A\u00a0simple and deterministic competitive algorithm for online facility location. Inf. Comput. 194(2), 175\u2013202 (2004)","journal-title":"Inf. Comput."},{"key":"139_CR4_139","first-page":"40","volume-title":"Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"M. Andrews","year":"1998","unstructured":"Andrews, M., Zhang, L.: The access network design problem. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.\u00a040\u201349. IEEE Computer Society, Los Alamitos, CA, USA (1998)"},{"key":"139_CR5_139","first-page":"106","volume-title":"Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC)","author":"S. Arora","year":"1998","unstructured":"Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean k-medians and related problems. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), pp.\u00a0106\u2013113. ACM, New York (1998)"},{"key":"139_CR6_139","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/380752.380755","volume-title":"Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC)","author":"V. Arya","year":"2001","unstructured":"Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), pp.\u00a021\u201329. ACM, New York (2001)"},{"key":"139_CR7_139","unstructured":"Balinski, M.L.: On finding integer solutions to linear programs. In: Proceedings of the IBM Scientific Computing Symposium on Combinatorial Problems, pp.\u00a0225\u2013248 IBM, White Plains, NY (1966)"},{"key":"139_CR8_139","unstructured":"Balinski, M.L., Wolfe, P.: On Benders decomposition and a\u00a0plant location problem. In ARO-27. Mathematica Inc. Princeton (1963)"},{"key":"139_CR9_139","unstructured":"Beasley, J.E.: Operations research library. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html. Accessed 2008"},{"key":"139_CR10_139","first-page":"29","volume-title":"Proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), Lecture Notes in Computer Science, vol. 4627","author":"J. Byrka","year":"2007","unstructured":"Byrka, J.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. In: Proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), Lecture Notes in Computer Science, vol. 4627, pp.\u00a029\u201343. Springer, Berlin (2007)"},{"key":"139_CR11_139","first-page":"1","volume-title":"Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC)","author":"M. Charikar","year":"1999","unstructured":"Charikar, M., Guha, S., Tardos, E., Shmoys, D.B.: A\u00a0constant-factor approximation algorithm for the k-median problem. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), pp.\u00a01\u201310. ACM, New York (1999)"},{"key":"139_CR12_139","first-page":"642","volume-title":"Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"M. Charikar","year":"2001","unstructured":"Charikar, M., Khuller, S., Mount, D., Narasimhan, G.: Facility location with outliers. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0642\u2013651. SIAM, Philadelphia (2001)"},{"issue":"1","key":"139_CR13_139","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703405754","volume":"33","author":"F.A. Chudak","year":"2003","unstructured":"Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J\u00a0Comput. 33(1), 1\u201325 (2003)","journal-title":"SIAM J Comput."},{"key":"139_CR14_139","first-page":"99","volume-title":"Proceedings of the 7th Conference on Integer Programing and Combinatorial Optimization (IPCO). Lecture Notes in Computer Science, vol. 1610","author":"F.A. Chudak","year":"1999","unstructured":"Chudak, F.A., Wiliamson, D.P.: Improved approximation algorithms for capacitated facility location problems. In: Proceedings of the 7th Conference on Integer Programing and Combinatorial Optimization (IPCO). Lecture Notes in Computer Science, vol.\u00a01610, pp.\u00a099\u2013113. Springer, Berlin (1999)"},{"key":"139_CR15_139","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"8","author":"G. Cornu\u00e9jols","year":"1977","unstructured":"Cornu\u00e9jols, G., Fisher, M.L., Nemhauser, G.L.: Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Manag. Sci. 8, 789\u2013810 (1977)","journal-title":"Manag. Sci."},{"key":"139_CR16_139","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D. Erlenkotter","year":"1978","unstructured":"Erlenkotter, D.: A\u00a0dual-based procedure for uncapacitated facility location problems. Oper. Res. 26, 992\u20131009 (1978)","journal-title":"Oper. Res."},{"key":"139_CR17_139","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A\u00a0threshold of $$ { \\ln n } $$ for approximating set cover. J.\u00a0ACM 45, 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"139_CR18_139","first-page":"637","volume-title":"Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 2719","author":"D. Fotakis","year":"2003","unstructured":"Fotakis, D.: On the competitive ratio for online facility location. In: Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol.\u00a02719, pp.\u00a0637\u2013652. Springer, Berlin (2003)"},{"key":"139_CR19_139","first-page":"228","volume-title":"Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"S. Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. In: Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0228\u2013248. SIAM, Philadelphia (1998)"},{"key":"139_CR20_139","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.\u00a0Algorithms 31, 228\u2013248 (1999)","journal-title":"J. Algorithms"},{"key":"139_CR21_139","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/380752.380827","volume-title":"Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC)","author":"S. Guha","year":"2001","unstructured":"Guha, S., Meyerson, A., Munagala, K.: A\u00a0constant factor approximation for the single sink edge installation problem. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), pp.\u00a0383\u2013388. ACM Press, New York (2001)"},{"key":"139_CR22_139","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1109\/SFCS.2000.892328","volume-title":"Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"S. Guha","year":"2000","unstructured":"Guha, S., Meyerson, A., Munagala, K.: Hierarchical placement and network design problems. In: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.\u00a0603\u2013612. IEEE Computer Society, Los Alamitos, CA, USA (2000)"},{"key":"139_CR23_139","first-page":"417","volume-title":"Proceedings of the 36st Annual ACM Symposium on Theory of Computing (STOC)","author":"A. Gupta","year":"2004","unstructured":"Gupta, A., P\u00e1l, M., Ravi, R., Sinha, A.: Boosted sampling: approximation algorithms for stochastic optimization. In: Proceedings of the 36st Annual ACM Symposium on Theory of Computing (STOC), pp.\u00a0417\u2013426. ACM, New York (2004)"},{"issue":"1","key":"139_CR24_139","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1002\/net.10080","volume":"42","author":"M. Hajiaghayi","year":"2003","unstructured":"Hajiaghayi, M., Mahdian, M., Mirrokni, V.S.: The facility location problem with general cost functions. Netw. 42(1), 42\u201347 (2003)","journal-title":"Netw."},{"issue":"2","key":"139_CR25_139","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/BF01581035","volume":"22","author":"D.S. Hochbaum","year":"1982","unstructured":"Hochbaum, D.S.: Heuristics for the fixed cost median problem. Math. Program. 22(2), 148\u2013162 (1982)","journal-title":"Math. Program."},{"key":"139_CR26_139","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A\u00a0best possible approximation algorithm for the k-center problem. Math. Oper. Res. 10, 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"key":"139_CR27_139","first-page":"165","volume-title":"Proceedings of the 2nd International Workshop on Experimental and Efficient Algorithms (WEA). Lecture Notes in Computer Science, vol. 2647","author":"M. Hoefer","year":"2003","unstructured":"Hoefer, M.: Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location. In: Proceedings of the 2nd International Workshop on Experimental and Efficient Algorithms (WEA). Lecture Notes in Computer Science, vol.\u00a02647, pp.\u00a0165\u2013178. Springer, Berlin (2003)"},{"issue":"6","key":"139_CR28_139","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.V.: Approximation algorithms for facility location via dual fitting with factor-revealing LP. J.\u00a0ACM 50(6), 795\u2013824 (2003)","journal-title":"J. ACM"},{"key":"139_CR29_139","doi-asserted-by":"crossref","unstructured":"Jain, K., Mahdian, M., Saberi, A.: A\u00a0new greedy approach for facility location problems. In: Proceedings of the 34st Annual ACM Symposium on Theory of Computing (STOC) pp.\u00a0731\u2013740, ACM Press, New York (2002)","DOI":"10.1145\/509907.510012"},{"key":"139_CR30_139","first-page":"177","volume-title":"Approximation Algorithms for Combinatorial Optimization, Proceedings of APPROX (2000), vol. (1913) of Lecture Notes in Computer Science","author":"K. Jain","year":"2000","unstructured":"Jain, K., Vazirani, V.V.: An approximation algorithm for the fault tolerant metric facility location problem. In: Approximation Algorithms for Combinatorial Optimization, Proceedings of APPROX (2000), vol. (1913) of Lecture Notes in Computer Science, pp.\u00a0177\u2013183. Springer, Berlin (2000)"},{"key":"139_CR31_139","first-page":"295","volume-title":"Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), vol. 1","author":"S. Jamin","year":"2000","unstructured":"Jamin, S., Jin, C., Jin, Y., Raz, D., Shavitt, Y., Zhang, L.: On the placement of internet instrumentations. In: Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), vol.\u00a01, pp.\u00a0295\u2013304. IEEE Computer Society, Los Alamitos, CA, USA (2000)"},{"key":"139_CR32_139","doi-asserted-by":"crossref","unstructured":"Karger, D., Minkoff, M.: Building Steiner trees with incomplete global knowledge. In: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society, pp.\u00a0613\u2013623. Los Alamitos (2000)","DOI":"10.1109\/SFCS.2000.892329"},{"key":"139_CR33_139","first-page":"1","volume-title":"Discrete Location Theory","author":"J. Krarup","year":"1990","unstructured":"Krarup, J., Pruzan, P.M.: Ingredients of locational analysis. In: Mirchandani, P., Francis, R. (eds.) Discrete Location Theory, pp.\u00a01\u201354. Wiley, New York (1990)"},{"key":"139_CR34_139","first-page":"38","volume":"12","author":"J. Krarup","year":"1983","unstructured":"Krarup, J., Pruzan, P.M.: The simple plant location problem: Survey and synthesis. Eur. J.\u00a0Oper. Res. 12, 38\u201381 (1983)","journal-title":"Eur. J. Oper. Res."},{"key":"139_CR35_139","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1287\/mnsc.9.4.643","volume":"9","author":"A.A. Kuehn","year":"1963","unstructured":"Kuehn, A.A., Hamburger, M.J.: A\u00a0heuristic program for locating warehouses. Manag. Sci. 9, 643\u2013666 (1963)","journal-title":"Manag. Sci."},{"key":"139_CR36_139","first-page":"1282","volume-title":"Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM)","author":"B. Li","year":"1999","unstructured":"Li, B., Golin, M., Italiano, G., Deng, X., Sohraby, K.: On the optimal placement of web proxies in the internet. In: Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp.\u00a01282\u20131290. IEEE Computer Society, Los Alamitos (1999)"},{"key":"139_CR37_139","unstructured":"Mahdian, M.: Facility Location and the Analysis of Algorithms through Factor-Revealing Programs. Ph.\u202fD. thesis, MIT, Cambridge (2004)"},{"key":"139_CR38_139","first-page":"409","volume-title":"Proceedings of the 11th Annual European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol. 2832","author":"M. Mahdian","year":"2003","unstructured":"Mahdian, M., P\u00e1l, M.: Universal facility location. In: Proceedings of the 11th Annual European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol.\u00a02832, pp.\u00a0409\u2013421. Springer, Berlin (2003)"},{"issue":"2","key":"139_CR39_139","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/S0097539703435716","volume":"36","author":"M. Mahdian","year":"2006","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: Approximation algorithms for metric facility location problems. SIAM J.\u00a0Comput. 36(2), 411\u2013432 (2006)","journal-title":"SIAM J. Comput."},{"key":"139_CR40_139","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1287\/mnsc.11.2.213","volume":"11","author":"A.S. Manne","year":"1964","unstructured":"Manne, A.S.: Plant location under economies-of-scale \u2013 decentralization and computation. Manag. Sci. 11, 213\u2013235 (1964)","journal-title":"Manag. Sci."},{"key":"139_CR41_139","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1109\/SFCS.2001.959917","volume-title":"Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"A. Meyerson","year":"2001","unstructured":"Meyerson, A.: Online facility location. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.\u00a0426\u2013431. IEEE Computer Society, Los Alamitos (2001)"},{"key":"139_CR42_139","volume-title":"Discrete Location Theory","author":"P.B. Mirchandani","year":"1990","unstructured":"Mirchandani, P.B., Francis, R.L.: Discrete Location Theory. Wiley, New York (1990)"},{"key":"139_CR43_139","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1990","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1990)"},{"key":"139_CR44_139","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1109\/SFCS.2001.959907","volume-title":"Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"M. P\u00e1l","year":"2001","unstructured":"P\u00e1l, M., Tardos, E., Wexler, T.: Facility location with nonuniform hard capacities. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.\u00a0329\u2013338. IEEE Computer Society, Los Alamitos (2001)"},{"key":"139_CR45_139","first-page":"1587","volume-title":"Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM )","author":"L. Qiu","year":"2001","unstructured":"Qiu, L., Padmanabhan, V.N., Voelker, G.: On the placement of web server replicas. In: Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM ), pp.\u00a01587\u20131596. IEEE Computer Society, Los Alamitos (2001)"},{"issue":"1","key":"139_CR46_139","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10107-005-0673-5","volume":"108","author":"R. Ravi","year":"2006","unstructured":"Ravi, R., Sinha, A.: Hedging uncertainty: Approximation algorithms for stochastic optimization problems. Math. Program. 108(1), 97\u2013114 (2006)","journal-title":"Math. Program."},{"key":"139_CR47_139","first-page":"212","volume-title":"Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization (IPCO). Lecture Notes in Computer Science, vol. 2337","author":"R. Ravi","year":"2002","unstructured":"Ravi, R., Sinha, A.: Integrated logistics: Approximation algorithms combining facility location and network design. In: Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization (IPCO). Lecture Notes in Computer Science, vol.\u00a02337, pp.\u00a0212\u2013229. Springer, Berlin (2002)"},{"key":"139_CR48_139","first-page":"342","volume-title":"Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"R. Ravi","year":"2004","unstructured":"Ravi, R., Sinha, A.: Multicommodity facility location. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0342\u2013349. SIAM, Philadelphia (2004)"},{"key":"139_CR49_139","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-44436-X_4","volume-title":"Approximation Algorithms for Combinatorial Optimization. Lecture Notes in Computer Science, vol. 1913","author":"D.B. Shmoys","year":"2000","unstructured":"Shmoys, D.B.: Approximation algorithms for facility location problems. In: Jansen, K., Khuller, S. (eds.) Approximation Algorithms for Combinatorial Optimization. Lecture Notes in Computer Science, vol.\u00a01913, pp.\u00a027\u201333. Springer, Berlin (2000)"},{"key":"139_CR50_139","first-page":"85","volume-title":"Proceedings of Symposia in Appl. Mathematics, vol. 61","author":"D.B. Shmoys","year":"2004","unstructured":"Shmoys, D.B.: The design and analysis of approximation algorithms: Facility location as a\u00a0case study. In: Thomas, R.R., Hosten, S., Lee, J. (eds) Proceedings of Symposia in Appl. Mathematics, vol.\u00a061, pp.\u00a085\u201397. AMS, Providence, RI, USA (2004)"},{"key":"139_CR51_139","first-page":"265","volume-title":"Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC)","author":"D.B. Shmoys","year":"1997","unstructured":"Shmoys, D.B., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), pp.\u00a0265\u2013274. ACM Press, New York (1997)"},{"key":"139_CR52_139","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/1109557.1109576","volume-title":"Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA)","author":"Z. Svitkina","year":"2006","unstructured":"Svitkina, Z., Tardos, E.: Facility location with hierarchical facility costs. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA), pp.\u00a0153\u2013161. SIAM, Philadelphia, PA, USA (2006)"},{"issue":"4","key":"139_CR53_139","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00453-004-1112-3","volume":"40","author":"C. Swamy","year":"2004","unstructured":"Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. Algorithmica 40(4), 245\u2013269 (2004)","journal-title":"Algorithmica"},{"key":"139_CR54_139","first-page":"735","volume-title":"Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"C. Swamy","year":"2003","unstructured":"Swamy, C., Shmoys, D.B.: Fault-tolerant facility location. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0735\u2013736. SIAM, Philadelphia (2003)"},{"key":"139_CR55_139","unstructured":"Vygen, J.: Approximation algorithms for facility location problems (lecture notes). Technical report No. 05950-OR, Research Institute for Discrete Mathematics, University of Bonn (2005) http:\/\/www.or.uni-bonn.de\/~vygen\/fl.pdf"},{"key":"139_CR56_139","doi-asserted-by":"crossref","unstructured":"Zhang, J.: Approximating the two-level facility location problem via a\u00a0quasi-greedy approach. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0808\u2013817. SIAM, Philadelphia (2004). Also, Math. Program. 108, 159\u2013176 (2006)","DOI":"10.1007\/s10107-006-0704-x"},{"issue":"2","key":"139_CR57_139","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1287\/moor.1040.0125","volume":"30","author":"J. Zhang","year":"2005","unstructured":"Zhang, J., Chen, B., Ye, Y.: A\u00a0multiexchange local search algorithm for the capacitated facility location problem. Math. Oper. Res. 30(2), 389\u2013403 (2005)","journal-title":"Math. Oper. Res."}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_139","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T16:32:44Z","timestamp":1738254764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_139"}},"subtitle":["1997; Shmoys, Tardos, Aardal"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_139","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008]]}}}