{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T07:53:41Z","timestamp":1782978821480,"version":"3.54.5"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319621265","type":"print"},{"value":"9783319621272","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62127-2_28","type":"book-chapter","created":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T02:47:31Z","timestamp":1499136451000},"page":"325-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Capacitated Center Problems with Two-Sided Bounds and Outliers"],"prefix":"10.1007","author":[{"given":"Hu","family":"Ding","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lunjia","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lingxiao","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,7,5]]},"reference":[{"issue":"3","key":"28_CR1","doi-asserted-by":"publisher","first-page":"49:1","DOI":"10.1145\/1798596.1798602","volume":"6","author":"G Aggarwal","year":"2010","unstructured":"Aggarwal, G., Panigrahy, R., Feder, T., Thomas, D., Kenthapadi, K., Khuller, S., Zhu, A.: Achieving anonymity via clustering. ACM Trans. Algorithms 6(3), 49:1\u201349:19 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"28_CR2","unstructured":"Ahmadian, S., Swamy, C.: Approximation algorithms for clustering problems with lower bounds and outliers (2016). arXiv preprint arxiv:1608.01700"},{"issue":"1\u20132","key":"28_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10107-014-0857-y","volume":"154","author":"HC An","year":"2015","unstructured":"An, H.C., Bhaskara, A., Chekuri, C., Gupta, S., Madan, V., Svensson, O.: Centrality of trees for capacitated k-center. Mathematical Programming 154(1\u20132), 29\u201353 (2015)","journal-title":"Mathematical Programming"},{"issue":"3","key":"28_CR4","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 33(3), 544\u2013562 (2004)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"28_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1006\/jagm.1993.1047","volume":"15","author":"J Barilan","year":"1993","unstructured":"Barilan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. Journal of Algorithms 15(3), 385\u2013415 (1993)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"28_CR6","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 34(4), 803\u2013824 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S., Tardos, \u00c9., Shmoys, D.B.: A constant-factor approximation algorithm for the k-median problem. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp. 1\u201310. ACM (1999)","DOI":"10.1145\/301250.301257"},{"key":"28_CR8","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 642\u2013651. Society for Industrial and Applied Mathematics (2001)"},{"issue":"1","key":"28_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00453-015-0010-1","volume":"75","author":"DZ Chen","year":"2016","unstructured":"Chen, D.Z., Li, J., Liang, H., Wang, H.: Matroid and knapsack center problems. Algorithmica 75(1), 27\u201352 (2016)","journal-title":"Algorithmica"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Cygan, M., Hajiaghayi, M., Khuller, S.: Lp rounding for k-centers with non-uniform hard capacities. In: Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp. 273\u2013282. IEEE Computer Society (2012)","DOI":"10.1109\/FOCS.2012.63"},{"key":"28_CR11","unstructured":"Dick, T., Li, M., Pillutla, V.K., White, C., Balcan, M.F., Smola, A.: Data driven resource allocation for distributed learning (2015). arXiv preprint arxiv:1512.04848"},{"key":"28_CR12","unstructured":"Ding, H.: Balanced $$ k $$-center clustering when $$ k $$ is a constant (2017). arXiv preprint arxiv:1704.02515"},{"key":"28_CR13","unstructured":"Ene, A., Har-Peled, S., Raichel, B.: Fast clustering with lower bounds: No customer too far, no shop too small (2013). arXiv preprint arxiv:1304.7318"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-662-49529-2_33","volume-title":"LATIN 2016: Theoretical Informatics","author":"CG Fernandes","year":"2016","unstructured":"Fernandes, C.G., Paula, S.P., Pedrosa, L.L.C.: Improved approximation algorithms for capacitated fault-tolerant k-center. In: Kranakis, E., Navarro, G., Ch\u00e1vez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 441\u2013453. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-49529-2_33"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theoretical Computer Science 38, 293\u2013306 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"28_CR16","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. Journal of Algorithms 31(1), 228\u2013248 (1999)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"28_CR17","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the k-center problem. Mathematics of Operations Research 10(2), 180\u2013184 (1985)","journal-title":"Mathematics of Operations Research"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 731\u2013740. ACM (2002)","DOI":"10.1145\/509907.510012"},{"issue":"2","key":"28_CR19","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 (JACM) 48(2), 274\u2013296 (2001)","journal-title":"Journal of the ACM (JACM)"},{"issue":"3","key":"28_CR20","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 Journal on Discrete Mathematics 13(3), 403\u2013418 (2000)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"28_CR21","unstructured":"Kociumaka, T., Cygan, M.: Constant factor approximation for capacitated k-center with outliers (2014). arXiv preprint arxiv:1401.2874"},{"issue":"1","key":"28_CR22","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1006\/jagm.2000.1100","volume":"37","author":"MR 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 37(1), 146\u2013188 (2000)","journal-title":"Journal of Algorithms"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-14165-2_17","volume-title":"Automata, Languages and Programming","author":"J Li","year":"2010","unstructured":"Li, J., Yi, K., Zhang, Q.: Clustering with diversity. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 188\u2013200. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-14165-2_17"},{"key":"28_CR24","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.ic.2012.01.007","volume":"222","author":"S Li","year":"2013","unstructured":"Li, S.: A 1.488 approximation algorithm for the uncapacitated facility location problem. Information and Computation 222, 45\u201358 (2013)","journal-title":"Information and Computation"},{"issue":"2","key":"28_CR25","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1137\/130938645","volume":"45","author":"S Li","year":"2016","unstructured":"Li, S., Svensson, O.: Approximating k-median via pseudo-approximation. SIAM Journal on Computing 45(2), 530\u2013547 (2016)","journal-title":"SIAM Journal on Computing"},{"issue":"05","key":"28_CR26","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L.: k-anonymity: A model for protecting privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 10(05), 557\u2013570 (2002)","journal-title":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62127-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T01:34:27Z","timestamp":1750469667000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62127-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319621265","9783319621272"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62127-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"5 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. John's","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}