{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T16:57:26Z","timestamp":1776358646944,"version":"3.51.2"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T00:00:00Z","timestamp":1655424000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T00:00:00Z","timestamp":1655424000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12001523"],"award-info":[{"award-number":["12001523"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871081"],"award-info":[{"award-number":["11871081"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12131003"],"award-info":[{"award-number":["12131003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fundamental Research Project of Shenzhen City","award":["JCYJ20210324102012033"],"award-info":[{"award-number":["JCYJ20210324102012033"]}]},{"name":"Guangxi Key Laboratory of Cryptography and Information Security","award":["GCIS202116"],"award-info":[{"award-number":["GCIS202116"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10898-022-01195-3","type":"journal-article","created":{"date-parts":[[2022,6,16]],"date-time":"2022-06-16T22:02:32Z","timestamp":1655416952000},"page":"603-618","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Approximation algorithms for the individually fair k-center with outliers"],"prefix":"10.1007","volume":"87","author":[{"given":"Lu","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5209-107X","authenticated-orcid":false,"given":"Yicheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,17]]},"reference":[{"key":"1195_CR1","doi-asserted-by":"crossref","unstructured":"Abbasi, M., Bhaskara, A., Venkatasubramanian, S.: Fair clustering via equitable group representations. In: Proceedings of ACM FAT, pp. 504-514 (2021)","DOI":"10.1145\/3442188.3445913"},{"key":"1195_CR2","doi-asserted-by":"crossref","unstructured":"Ahmadian, S., Epasto, A., Kumar, R., Mahdian, M.: Clustering without over-representation. In: Proceedings of SIGKDD, pp. 267-275 (2019)","DOI":"10.1145\/3292500.3330987"},{"key":"1195_CR3","unstructured":"Backurs, A., Indyk, P., Onak, K., Schieber, B., Vakilian, A., Wagner, T.: Scalable fair clustering. In: Proceedings of ICML, pp. 405-413 (2019)"},{"key":"1195_CR4","unstructured":"Bera, S. K., Chakrabarty, D., Flores, N. J., Negahbani, N.: Fair algorithms for clustering. In: Proceedings of NeurIPS, pp. 4954-4965 (2019)"},{"key":"1195_CR5","unstructured":"Bercea, I. O., Gro\u00df, M., Khuller, S., Kumar, A., Rosner, C., Schmidt, D. R., Schmidt, M.: On the cost of essentially fair clusterings. arXiv preprint arXiv:1811.10319, (2018)"},{"key":"1195_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2981561","volume":"13","author":"J Byrka","year":"2017","unstructured":"Byrka, J., Pensyl, T., Rybicki, B., Srinivasan, A., Trinh, K.: An improved approximation for $$k$$-median and positive correlation in budgeted optimization. ACM Trans. Algorithms 13, 1\u201331 (2017)","journal-title":"ACM Trans. Algorithms"},{"key":"1195_CR7","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. 65, 129\u2013149 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"1195_CR8","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Vassilvitskii, S.: Fair clustering through fairlets. In: Proceedings of NeurIPS, pp. 5036-5044 (2017)"},{"key":"1195_CR9","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V.: Approximation schemes for capacitated clustering in doubling metrics. In: Proceedings of SODA, pp. 2241-2259 (2020)","DOI":"10.1137\/1.9781611975994.138"},{"key":"1195_CR10","doi-asserted-by":"crossref","unstructured":"Ghadiri, M., Samadi, S., Vempala, S.: Socially fair $$k$$-means clustering. In: Proceedings of ACM FAT, pp. 438-448 (2021)","DOI":"10.1145\/3442188.3445906"},{"key":"1195_CR11","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. Theoret. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"1195_CR12","unstructured":"Huang, L., Jiang, S. H. C., Vishnoi, N. K.: Coresets for clustering with fairness constraints. In: Proceedings of NeurIPS, pp. 7589-7600 (2019)"},{"key":"1195_CR13","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. Math. Oper. Res. 10, 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"key":"1195_CR14","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/5925.5933","volume":"33","author":"DS Hochbaum","year":"1986","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A unified approach to approximation algorithms for bottleneck problems. J. ACM 33, 533\u2013550 (1986)","journal-title":"J. ACM"},{"key":"1195_CR15","unstructured":"Jones, M., Nguyen, H., Nguyen, T.: Fair $$k$$-centers via maximum matching. In: Proceedings of ICML, pp. 4940-4949 (2020)"},{"key":"1195_CR16","unstructured":"Jung, C., Kannan, S., Lutz, N.: Service in your neighborhood: Fairness in center location. In: Proceedings of FORC, pp. 5:1-5:15 (2020)"},{"key":"1195_CR17","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(98)00222-9","volume":"242","author":"S Khuller","year":"2000","unstructured":"Khuller, S., Pless, R., Sussmann, Y.J.: Fault tolerant $$k$$-center problems. Theoret. Comput. Sci. 242, 237\u2013245 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"1195_CR18","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. Discret. Math. 13, 403\u2013418 (2000)","journal-title":"SIAM J. Discret. Math."},{"key":"1195_CR19","unstructured":"Kleindessner, M., Awasthi, P., Morgenstern, J.: Fair $$k$$-center clustering for data summarization. In: Proceedings of ICML, pp. 3448-3457 (2019)"},{"key":"1195_CR20","doi-asserted-by":"crossref","unstructured":"Krishnaswamy, R., Li, S., Sandeep, S.: Constant approximation for $$k$$-median and $$k$$-means with outliers via iterative rounding. In: Proceedings of STOC, pp. 646-659 (2018)","DOI":"10.1145\/3188745.3188882"},{"key":"1195_CR21","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. Inf. Comput. 222, 45\u201358 (2013)","journal-title":"Inf. Comput."},{"key":"1195_CR22","unstructured":"Mahabadi, S., Vakilian, A.: Individual fairness for $$k$$-clustering. In: Proceedings of ICML, pp. 6586-6596 (2020)"},{"key":"1195_CR23","unstructured":"Makarychev, Y., Vakilian, A.: Approximation Algorithms for Socially Fair Clustering. arXiv preprint arXiv:2103.02512, (2021)"},{"key":"1195_CR24","doi-asserted-by":"crossref","unstructured":"Schmidt, M., Schwiegelshohn, C., Sohler, C.: Fair coresets and streaming algorithms for fair $$k$$-means. In: Proceedings of WAOA, pp. 232-251 (2019)","DOI":"10.1007\/978-3-030-39479-0_16"},{"key":"1195_CR25","doi-asserted-by":"crossref","unstructured":"Shmoys, D. B., Tardos, \u00c9., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of STOC, pp. 265-274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"1195_CR26","unstructured":"Vakilian, A., Yal\u00e7\u0131ner, M.: Improved approximation algorithms for individually fair clustering. arXiv preprint arXiv:2106.14043, (2021)"},{"key":"1195_CR27","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10898-015-0394-0","volume":"67","author":"Y Xu","year":"2017","unstructured":"Xu, Y., Xu, D., Du, D., Wu, C.: Local search algorithm for universal facility location problem with linear penalties. J. Global Optim. 67, 367\u2013378 (2017)","journal-title":"J. Global Optim."},{"key":"1195_CR28","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tcs.2020.05.038","volume":"838","author":"Y Xu","year":"2020","unstructured":"Xu, Y., Xu, D., Zhang, Y., Zou, J.: MpUFLP: Universal facility location problem in the $$p$$-th power of metric space. Theoret. Comput. Sci. 838, 58\u201367 (2020)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01195-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01195-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01195-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T19:55:40Z","timestamp":1698782140000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01195-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,17]]},"references-count":28,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1195"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01195-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,17]]},"assertion":[{"value":"28 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}