{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:12:28Z","timestamp":1761973948225,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387678"},{"type":"electronic","value":"9783642387685"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38768-5_27","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T04:31:28Z","timestamp":1368765088000},"page":"292-303","source":"Crossref","is-referenced-by-count":11,"title":["Improved Approximation Algorithms for the Facility Location Problems with Linear\/submodular Penalty"],"prefix":"10.1007","author":[{"given":"Yu","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naihua","family":"Xiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0020-0190(99)00144-1","volume":"72","author":"K.I. Aardal","year":"1999","unstructured":"Aardal, K.I., Chudak, F.A., Shmoys, D.B.: A 3-approximation algorithm for the k-level uncapacitated facility location problem. Information Processing Letters\u00a072, 161\u2013167 (1999)","journal-title":"Information Processing Letters"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/S0895480102417215","volume":"18","author":"A. Ageev","year":"2003","unstructured":"Ageev, A., Ye, Y., Zhang, J.: Improved combinatorial approximation algorithms for the k-level facility location problem. SIAM Journal on Discrete Mathematics\u00a018, 207\u2013217 (2003)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"2212","DOI":"10.1137\/070708901","volume":"39","author":"J. Byrka","year":"2010","unstructured":"Byrka, J., Aardal, K.I.: An optimal bi-factor approximation algorithm for the metric uncapacitated facility location problem. SIAM Journal on Computing\u00a039, 2212\u20132231 (2010)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for facility location and k-median problems. In: Proceedings of FOCS, pp. 378\u2013388 (1999)","DOI":"10.1109\/SFFCS.1999.814609"},{"key":"27_CR5","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Naraasimban, G.: Algorithms for facility location problems with outliers. In: Proceedings of SODA, pp. 642\u2013651 (2001)"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00453-007-9032-7","volume":"53","author":"X. Chen","year":"2007","unstructured":"Chen, X., Chen, B.: Approximation algorithms for soft-capacitated facility location in capacitated network design. Algorithmica\u00a053, 263\u2013297 (2007)","journal-title":"Algorithmica"},{"key":"27_CR7","unstructured":"Chudak, F.A., Nagano, K.: Efficient solutions to relaxations of combinatorial problems with submodular penalty via the Lov\u00e1sz extension and non-smooth convex optimization. In: Proceedings of SODA, pp. 79\u201388 (2007)"},{"key":"27_CR8","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 Journal on Computing\u00a033, 1\u201325 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00453-011-9526-1","volume":"63","author":"D. Du","year":"2012","unstructured":"Du, D., Lu, R., Xu, D.: A primal-dual approximation algorithm for the facility location problem with submodular penalty. Algorithmica\u00a063, 191\u2013200 (2012)","journal-title":"Algorithmica"},{"key":"27_CR10","unstructured":"Fujishige, S.: Submodular Functions and Optimization, 2nd edn. Annals of Discrete Mathematics, vol.\u00a058. Elsevier (2005)"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10107-009-0310-9","volume":"130","author":"J. Geunes","year":"2011","unstructured":"Geunes, J., Levi, R., Romeijn, H.E., Shmoys, D.B.: Approximation algorithms for supply chain planning and logistics problems with market choice. Mathematical Programming\u00a0130, 85\u2013106 (2011)","journal-title":"Mathematical Programming"},{"key":"27_CR12","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 strike back: improved facility location algorithms. Journal of Algorithms\u00a031, 228\u2013248 (1999)","journal-title":"Journal of Algorithms"},{"key":"27_CR13","unstructured":"Hayrapetyan, A., Swamy, C., Tard\u00f6s, E.: Network design for information networks. In: Proceedings of SODA, pp. 933\u2013942 (2005)"},{"key":"27_CR14","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.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. Journal of the ACM\u00a050, 795\u2013824 (2003)","journal-title":"Journal of the ACM"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proceedings of STOC, pp. 731\u2013740 (2002)","DOI":"10.1145\/510008.510012"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K. Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. Journal of the ACM\u00a048, 274\u2013296 (2001)","journal-title":"Journal of the ACM"},{"key":"27_CR17","unstructured":"Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. In: Proceedings of SODA, pp. 1\u201310 (1998)"},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-22012-8_5","volume-title":"Automata, Languages and Programming","author":"S. Li","year":"2011","unstructured":"Li, S.: A 1.488 Approximation algorithm for the uncapacitated facility location problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 77\u201388. Springer, Heidelberg (2011)"},{"key":"27_CR19","unstructured":"Mahdian, M.: Facility location and the analysis of algorithms through factor-revealing programs. Ph. D. thesis, MIT, Cambridge, MA (2004)"},{"key":"27_CR20","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.: Improved approximation algorithms for metric facility location problems. SIAM Journal on Computing\u00a036, 411\u2013432 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR21","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1145\/1217856.1217860","volume":"53","author":"D.B. Shmoys","year":"2006","unstructured":"Shmoys, D.B., Swamy, C.: An approximation scheme for stochastic linear programming and its application to stochastic integer programs. Journal of the ACM\u00a053, 978\u20131012 (2006)","journal-title":"Journal of the ACM"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tard\u00f6s, E., Aardal, K.I.: Approximation algorithms for facility location problems. In: Proceedings of STOC, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"27_CR23","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1287\/opre.1040.0140","volume":"53","author":"J. Shu","year":"2005","unstructured":"Shu, J., Teo, C.P., Shen, Z.J.: Max: Stochastic transportation-inventory network design problem. Operations Research\u00a053, 48\u201360 (2005)","journal-title":"Operations Research"},{"key":"27_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/3-540-47867-1_18","volume-title":"Integer Programming and Combinatorial Optimization","author":"M. Sviridenko","year":"2002","unstructured":"Sviridenko, M.: An improved approximation algorithm for the metric uncapacitated facility location problem. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, pp. 240\u2013257. Springer, Heidelberg (2002)"},{"key":"27_CR25","unstructured":"Vygen, J.: Approximation algorithms for facility location problems (Lecture Notes). Report No. 05950-OR, Research Institute for Discrete Mathematics, University of Bonn (2005), http:\/\/www.or.uni-bonn.de\/vygen\/fl.pdf"},{"key":"27_CR26","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 penalty. Information Processing Letters\u00a094, 119\u2013123 (2005)","journal-title":"Information Processing Letters"},{"key":"27_CR27","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/s10878-007-9127-8","volume":"17","author":"G. Xu","year":"2008","unstructured":"Xu, G., Xu, J.: An improved approximation algorithm for uncapacitated facility location problem with penalty. Journal of Combinatorial Optimization\u00a017, 424\u2013436 (2008)","journal-title":"Journal of Combinatorial Optimization"},{"key":"27_CR28","doi-asserted-by":"crossref","unstructured":"Ye, Y., Zhang, J.: An approximation algorithm for the dynamic facility location problem. In: Combinatorial Optimization in Communication Networks, pp. 623\u2013637. Kluwer Academic Publishers (2005)","DOI":"10.1007\/0-387-29026-5_22"},{"key":"27_CR29","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10107-006-0704-x","volume":"108","author":"J. Zhang","year":"2006","unstructured":"Zhang, J.: Approximating the two-level facility location problem via a quasi-greedy approach. Mathematical Programming\u00a0108, 159\u2013176 (2006)","journal-title":"Mathematical Programming"},{"key":"27_CR30","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 multiexchange local search algorithm for the capacitated facility location problem. Mathematics of Operations Research\u00a030, 389\u2013403 (2005)","journal-title":"Mathematics of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38768-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T10:26:27Z","timestamp":1746008787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}