{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:45Z","timestamp":1759639065893,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642380150"},{"type":"electronic","value":"9783642380167"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38016-7_21","type":"book-chapter","created":{"date-parts":[[2013,4,30]],"date-time":"2013-04-30T17:58:58Z","timestamp":1367344738000},"page":"257-271","source":"Crossref","is-referenced-by-count":17,"title":["Improved Approximation Guarantees for Lower-Bounded Facility Location"],"prefix":"10.1007","author":[{"given":"Sara","family":"Ahmadian","sequence":"first","affiliation":[]},{"given":"Chaitanya","family":"Swamy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Ahmadian, S., Swamy, C.: Improved approximation guarantees for lower-bounded facility location. CS arXiV (September 2012)","DOI":"10.1007\/978-3-642-38016-7_21"},{"issue":"3","key":"21_CR2","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/S0097539702416402","volume":"33","author":"V. Arya","year":"2004","unstructured":"Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM Journal on Computing\u00a033(3), 544\u2013562 (2004)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"21_CR3","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1137\/S0097539701398594","volume":"34","author":"M. Charikar","year":"2005","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for facility location problems. SIAM Journal on Computing\u00a034(4), 803\u2013824 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR4","unstructured":"Guha, S., Meyerson, A., Munagala, K.: Facility location with demand dependent costs and generalized clustering (2000) (manuscript)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Guha, S., Meyerson, A., Munagala, K.: Hierarchical placement and network design problems. In: Proceedings of the 41st FOCS, pp. 603\u2013612 (2000)","DOI":"10.1109\/SFCS.2000.892328"},{"key":"21_CR6","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.: The facility location problem with general cost functions. Networks\u00a042, 42\u201347 (2003)","journal-title":"Networks"},{"key":"21_CR7","unstructured":"Hardy, G., Littlewood, J., P\u00f3lya, G.: Inequalities. Cambridge Univ. Press (1952)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Minkoff, M.: Building Steiner trees with incomplete global knowledge. In: Proceedings of the 41st FOCS, pp. 613\u2013623 (2000)","DOI":"10.1109\/SFCS.2000.892329"},{"issue":"1","key":"21_CR9","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1006\/jagm.2000.1100","volume":"37","author":"M.R. Korupolu","year":"2000","unstructured":"Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. Journal of Algorithms\u00a037(1), 146\u2013188 (2000)","journal-title":"Journal of Algorithms"},{"key":"21_CR10","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)"},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/trsc.1050.0123","volume":"40","author":"A. Lim","year":"2006","unstructured":"Lim, A., Wang, F., Xu, Z.: A transportation problem with minimum quantity commitment. Transportation Science\u00a040(1), 117\u2013129 (2006)","journal-title":"Transportation Science"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-540-39658-1_38","volume-title":"Algorithms - ESA 2003","author":"M. Mahdian","year":"2003","unstructured":"Mahdian, M., P\u00e1l, M.: Universal facility location. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 409\u2013421. Springer, Heidelberg (2003)"},{"volume-title":"Discrete Location Theory","year":"1990","key":"21_CR13","unstructured":"Mirchandani, P., Francis, R. (eds.): Discrete Location Theory. John Wiley and Sons, Inc., New York (1990)"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B.: The design and analysis of approximation algorithms: facility location as a case study. In: Hosten, S., Lee, J., Thomas, R. (eds.) Trends in Optimization. AMS Proc. of Symposia in Applied Math., vol.\u00a061, pp. 85\u201397 (2004)","DOI":"10.1090\/psapm\/061\/2104732"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, \u00c9., Aardal, K.I.: Approximation algorithms for facility location problems. In: Proceedings of the 29th STOC, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"21_CR16","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":"21_CR17","doi-asserted-by":"crossref","unstructured":"Svitkina, Z.: Lower-bounded facility location. Trans. on Algorithms 6(4) (2010)","DOI":"10.1145\/1824777.1824789"},{"key":"21_CR18","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 multi-exchange local search algorithm for the capacitated facility location problem. Math. of Oper. Research\u00a030, 389\u2013403 (2005)","journal-title":"Math. of Oper. Research"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38016-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T07:35:45Z","timestamp":1745998545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38016-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642380150","9783642380167"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38016-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}