{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T06:53:15Z","timestamp":1776322395203,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T00:00:00Z","timestamp":1776297600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T00:00:00Z","timestamp":1776297600000},"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":"crossref","award":["12371321"],"award-info":[{"award-number":["12371321"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100021171","name":"Guangdong Basic and Applied Basic Research Foundation","doi-asserted-by":"crossref","award":["2024A1515030197"],"award-info":[{"award-number":["2024A1515030197"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Shenzhen Natural Science Foundation Youth Program Category B","award":["202507013000817"],"award-info":[{"award-number":["202507013000817"]}]},{"name":"Shenzhen key Laboratory of Intelligent Bioinformatics","award":["ZDSYS20220422103800001"],"award-info":[{"award-number":["ZDSYS20220422103800001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s00224-026-10275-w","type":"journal-article","created":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T06:14:24Z","timestamp":1776320064000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Individual Preference Facility Location: A Dual-Fitting Framework and Its Extensions"],"prefix":"10.1007","volume":"70","author":[{"given":"Shuilian","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yicheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,16]]},"reference":[{"key":"10275_CR1","unstructured":"Bagheri\u00a0Nezhad, S., Bandyapadhyay, S., Chen, T.: Polynomial-time constant-approximation for fair sum-of-radii clustering. In: Proceedings of the Annual European Symposium on Algorithms (ESA). pp. 62\u20131 (2025)"},{"key":"10275_CR2","unstructured":"Bandyapadhyay, S., Inamdar, T., Pai, S., Varadarajan, K.: A constant approximation for colorful $$k$$-center. In: Proceedings of the European Symposium on Algorithms (ESA) (2019)"},{"key":"10275_CR3","unstructured":"Bateni, M., Cohen-Addad, V., Epasto, A., Lattanzi, S.: A scalable algorithm for individually fair $$k$$-means clustering. In: Proceedings of the International Conference on Artificial Intelligence and Statistics (AISTATS). pp. 3151\u20133159 (2024)"},{"key":"10275_CR4","unstructured":"Bera, S., Chakrabarty, D., Flores, N., Negahbani, M.: Fair algorithms for clustering. In: Proceedings of the Advances in Neural Information Processing Systems (NeurIPS). pp. 4955\u20134966 (2019)"},{"key":"10275_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and $$k$$-median problems. In: Proceedings of the Symposium on Foundations of Computer Science (FOCS). pp. 378\u2013388 (1999)","DOI":"10.1109\/SFFCS.1999.814609"},{"key":"10275_CR6","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA). pp. 642\u2013651 (2001)"},{"key":"10275_CR7","doi-asserted-by":"crossref","unstructured":"Chen, X., Xu, D., Xu, Y., Zhang, Y.: Parameterized approximation algorithms for sum of radii clustering and variants. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI). pp. 20666\u201320673 (2024)","DOI":"10.1609\/aaai.v38i18.30053"},{"key":"10275_CR8","unstructured":"Chhaya, R., Dasgupta, A., Choudhari, J., Shit, S.: On coresets for fair regression and individually fair clustering. In: Proceedings of the International Conference on Artificial Intelligence and Statistics (AISTATS). pp. 9603\u20139625 (2022)"},{"key":"10275_CR9","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Vassilvitskii, S.: Fair clustering through fairlets. In: Proceedings of the Advances in Neural Information Processing Systems (NeurIPS). pp. 5029\u20135037 (2017)"},{"key":"10275_CR10","unstructured":"Ebbens, M., Funk, N., H\u00f6ckendorff, J., Sohler, C., Weil, V.: A subquadratic time approximation algorithm for individually fair $$k$$-center. In: Proceedings of the International Conference on Artificial Intelligence and Statistics(AISTATS). pp. 2287\u20132295 (2024)"},{"key":"10275_CR11","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 31, 228\u2013248 (1999)","journal-title":"J. Algorithms"},{"key":"10275_CR12","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s10898-022-01195-3","volume":"87","author":"L Han","year":"2023","unstructured":"Han, L., Xu, D., Xu, Y., Yang, P.: Approximation algorithms for the individually fair $$k$$-center with outliers. J. Global Optim. 87, 603\u2013618 (2023)","journal-title":"J. Global Optim."},{"key":"10275_CR13","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. J. ACM 50, 795\u2013824 (2003)","journal-title":"J. ACM"},{"key":"10275_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 48, 274\u2013296 (2001)","journal-title":"J. ACM"},{"key":"10275_CR15","unstructured":"Jung, C., Kannan, S., Lutz, N.: Service in Your Neighborhood: Fairness in Center Location. In: Proceedings of the Foundations of Responsible Computing (FORC). pp. 5:1\u20135:15 (2020)"},{"key":"10275_CR16","unstructured":"Kleindessner, M., Awasthi, P., Morgenstern, J.: Fair k-center clustering for data summarization. In: Proceedings of the International Conference on Machine Learning (ICML). pp. 3448\u20133457 (2019)"},{"key":"10275_CR17","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. J. Algorithms 37, 146\u2013188 (2000)","journal-title":"J. Algorithms"},{"key":"10275_CR18","doi-asserted-by":"crossref","unstructured":"Li, S.: A 1.488 approximation algorithm for the uncapacitated facility location problem. Information and Computation 222, 45\u201358 (2013)","DOI":"10.1016\/j.ic.2012.01.007"},{"key":"10275_CR19","unstructured":"Liu, S., Gutin, G., Xu, Y., Zhang, Y.: Fpt constant approximation algorithms for colorful sum of radii. (2025). arXiv:2506.13191"},{"key":"10275_CR20","unstructured":"Mahabadi, S., Vakilian, A.: Individual fairness for k-clustering. In: Proceedings of the International Conference on Machine Learning (ICML). pp. 6586\u20136596 (2020)"},{"key":"10275_CR21","doi-asserted-by":"crossref","unstructured":"Maity, B., Das, S., Dasgupta, A.: Linear programming based approximation to individually fair $$k$$-clustering with outliers. (2024). arXiv:2412.10923","DOI":"10.1109\/ICDMW69685.2025.00045"},{"key":"10275_CR22","unstructured":"Negahbani, M., Chakrabarty, D.: Better algorithms for individually fair $$k$$-clustering. In: Proceedings of the Advances in Neural Information Processing Systems (NeurIPS). pp. 13340\u201313351 (2021)"},{"key":"10275_CR23","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, \u00c9., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the ACM Symposium on Theory of Computing (STOC). pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"10275_CR24","unstructured":"Vakilian, A., Yalciner, M.: Improved approximation algorithms for individually fair clustering. In: Proceedings of the International Conference on Artificial Intelligence and Statistics (AISTATS). pp. 8758\u20138779 (2022)"},{"key":"10275_CR25","doi-asserted-by":"crossref","unstructured":"Williamson, D.P., Shmoys, D.B.: The design of approximation algorithms. Cambridge university press (2011)","DOI":"10.1017\/CBO9780511921735"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-026-10275-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-026-10275-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-026-10275-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T06:14:34Z","timestamp":1776320074000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-026-10275-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,16]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["10275"],"URL":"https:\/\/doi.org\/10.1007\/s00224-026-10275-w","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,16]]},"assertion":[{"value":"23 January 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"29"}}