{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:54Z","timestamp":1763468214375},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075563"},{"type":"electronic","value":"9783319075570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07557-0_5","type":"book-chapter","created":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T11:50:30Z","timestamp":1400327430000},"page":"52-63","source":"Crossref","is-referenced-by-count":9,"title":["Centrality of Trees for Capacitated k-Center"],"prefix":"10.1007","author":[{"given":"Hyung-Chan","family":"An","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditya","family":"Bhaskara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chandra","family":"Chekuri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shalmoli","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vivek","family":"Madan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ola","family":"Svensson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"5_CR1","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 J. Comput.\u00a033(3), 544\u2013562 (2004)","journal-title":"SIAM J. Comput."},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-33090-2_13","volume-title":"Algorithms \u2013 ESA 2012","author":"M. Bansal","year":"2012","unstructured":"Bansal, M., Garg, N., Gupta, N.: A 5-approximation for capacitated facility location. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 133\u2013144. Springer, Heidelberg (2012)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Byrka, J.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. In: APPROX-RANDOM, pp. 29\u201343 (2007)","DOI":"10.1007\/978-3-540-74208-1_3"},{"issue":"4","key":"5_CR4","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 J. Comput.\u00a034(4), 803\u2013824 (2005)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jcss.2002.1882","volume":"65","author":"M. Charikar","year":"2002","unstructured":"Charikar, M., Guha, S., Tardos, \u00c9., Shmoys, D.B.: A constant-factor approximation algorithm for the k-median problem. J. Comput. Syst. Sci.\u00a065(1), 129\u2013149 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10107-004-0524-9","volume":"102","author":"F.A. Chudak","year":"2005","unstructured":"Chudak, F.A., Williamson, D.P.: Improved approximation algorithms for capacitated facility location problems. Math. Program.\u00a0102(2), 207\u2013222 (2005)","journal-title":"Math. Program."},{"key":"5_CR7","unstructured":"Chuzhoy, J., Rabani, Y.: Approximating k-median with non-uniform capacities. In: SODA, pp. 952\u2013958 (2005)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Cygan, M., Hajiaghayi, M., Khuller, S.: LP rounding for k-centers with non-uniform hard capacities. In: FOCS, pp. 273\u2013282 (2012)","DOI":"10.1109\/FOCS.2012.63"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T.F. Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci.\u00a038, 293\u2013306 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"5_CR10","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. Algorithms\u00a031(1), 228\u2013248 (1999)","journal-title":"J. Algorithms"},{"key":"5_CR11","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. Journal of the London Mathematical Society\u00a010, 26\u201330 (1935)","journal-title":"Journal of the London Mathematical Society"},{"key":"5_CR12","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 best possible heuristic for the k-center problem. Mathematics of Operations Research\u00a010, 180\u2013184 (1985)","journal-title":"Mathematics of Operations Research"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: STOC, pp. 731\u2013740 (2002)","DOI":"10.1145\/509907.510012"},{"issue":"2","key":"5_CR14","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. J. ACM\u00a048(2), 274\u2013296 (2001)","journal-title":"J. ACM"},{"issue":"3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/S0895480197329776","volume":"13","author":"S. Khuller","year":"2000","unstructured":"Khuller, S., Sussmann, Y.J.: The capacitated k-center problem. SIAM J. Discrete Math.\u00a013(3), 403\u2013418 (2000)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"5_CR16","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. J. Algorithms\u00a037(1), 146\u2013188 (2000)","journal-title":"J. Algorithms"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-540-25960-2_16","volume-title":"Integer Programming and Combinatorial Optimization","author":"R. Levi","year":"2004","unstructured":"Levi, R., Shmoys, D.B., Swamy, C.: LP-based approximation algorithms for capacitated facility location. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol.\u00a03064, pp. 206\u2013218. Springer, Heidelberg (2004)"},{"key":"5_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":"5_CR19","doi-asserted-by":"crossref","unstructured":"Li, S., Svensson, O.: Approximating k-median problem via pseudo-approximation. In: STOC, pp. 901\u2013910 (2013)","DOI":"10.1145\/2488608.2488723"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"P\u00e1l, M., Tardos, \u00c9., Wexler, T.: Facility location with nonuniform hard capacities. In: FOCS, pp. 329\u2013338 (2001)","DOI":"10.1109\/SFCS.2001.959907"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, \u00c9., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: STOC, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511921735"},{"issue":"2","key":"5_CR23","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. Math. Oper. Res.\u00a030(2), 389\u2013403 (2005)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07557-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T06:17:00Z","timestamp":1689229020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07557-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075563","9783319075570"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07557-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}