{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T23:14:17Z","timestamp":1783379657502,"version":"3.54.6"},"reference-count":53,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202161"],"award-info":[{"award-number":["62202161"]}],"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":["62432016"],"award-info":[{"award-number":["62432016"]}],"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":["62302060"],"award-info":[{"award-number":["62302060"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018607","name":"Henan Province Science and Technology Innovation Talent Program","doi-asserted-by":"publisher","award":["2025RC3207"],"award-info":[{"award-number":["2025RC3207"]}],"id":[{"id":"10.13039\/501100018607","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.ic.2026.105457","type":"journal-article","created":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T11:37:51Z","timestamp":1777549071000},"page":"105457","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Parameterized approximation schemes for fair-range clustering"],"prefix":"10.1016","volume":"311","author":[{"given":"Zhen","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaohong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Limei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jie","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junyu","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ic.2026.105457_bib0001","first-page":"6:1","article-title":"Parameterized approximation for robust clustering in discrete geometric spaces","volume":"297","author":"Abbasi","year":"2024","journal-title":"Proc. 51st Int. Colloq. Autom. Lang. Program."},{"key":"10.1016\/j.ic.2026.105457_bib0002","series-title":"Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency","first-page":"504","article-title":"Fair clustering via equitable group representations","author":"Abbasi","year":"2021"},{"key":"10.1016\/j.ic.2026.105457_bib0003","first-page":"197","article-title":"Individual preference stability for clustering","volume":"162","author":"Ahmadi","year":"2022","journal-title":"Proc. 39th Int. Conf. Mach. Learn."},{"key":"10.1016\/j.ic.2026.105457_bib0004","doi-asserted-by":"crossref","unstructured":"S. Ahmadian, A. Norouzi-Fard, O. Svensson, J. Ward, Better guarantees for k-means and Euclidean k-median by primal-dual algorithms, SIAM J. Comput 49(4) FOCS17:97\u2013FOCS17:156.","DOI":"10.1137\/18M1171321"},{"key":"10.1016\/j.ic.2026.105457_bib0005","first-page":"23:1","article-title":"On coresets for fair clustering in metric and Euclidean spaces and their applications","volume":"198","author":"Bandyapadhyay","year":"2021","journal-title":"Proc. 48th Int. Colloq. Autom. Lang. Program."},{"key":"10.1016\/j.ic.2026.105457_bib0006","series-title":"Proc. 27th Int. Conf. Artif. Intell. Stat.","first-page":"3151","article-title":"A scalable algorithm for individually fair k-means clustering","volume":"238","author":"Bateni","year":"2024"},{"key":"10.1016\/j.ic.2026.105457_bib0007","series-title":"Proceedings of the 32nd Annual Conference on Neural Information Processing Systems","first-page":"4955","article-title":"Fair algorithms for clustering","author":"Bera","year":"2019"},{"issue":"1","key":"10.1016\/j.ic.2026.105457_bib0008","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s00224-017-9820-7","article-title":"Faster algorithms for the constrained k-means problem","volume":"62","author":"Bhattacharya","year":"2018","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"10.1016\/j.ic.2026.105457_bib0009","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1137\/070699007","article-title":"On coresets for k-median and k-means clustering in metric and Euclidean spaces and their applications","volume":"39","author":"Chen","year":"2009","journal-title":"SIAM J. Comput"},{"key":"10.1016\/j.ic.2026.105457_bib0010","series-title":"Proc. 36th Int. Conf. Mach. Learn.","first-page":"1032","article-title":"Proportionally fair clustering","volume":"97","author":"Chen","year":"2019"},{"key":"10.1016\/j.ic.2026.105457_bib0011","series-title":"Proceedings of the 38th AAAI Conference on Artificial Intelligence","first-page":"20666","article-title":"Parameterized approximation algorithms for sum of radii clustering and variants","author":"Chen","year":"2024"},{"key":"10.1016\/j.ic.2026.105457_bib0012","series-title":"Proceedings of the 30th Annual Conference on Neural Information Processing Systems","first-page":"5029","article-title":"Fair clustering through fairlets","author":"Chierichetti","year":"2017"},{"key":"10.1016\/j.ic.2026.105457_bib0013","series-title":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","first-page":"1621","article-title":"Improved approximations for Euclidean k-means and k-median, via nested quasi-independent sets","author":"Cohen-Addad","year":"2022"},{"key":"10.1016\/j.ic.2026.105457_bib0014","series-title":"Proceedings of the 34th ACM-SIAM Symposium on Discrete Algorithms","first-page":"940","article-title":"Breaching the 2 LMP approximation barrier for facility location with applications to k-median","author":"Cohen-Addad","year":"2023"},{"key":"10.1016\/j.ic.2026.105457_bib0015","series-title":"Proceedings of the 46th International Colloquium on Automata, Languages, and Programming","first-page":"42:1","article-title":"Tight FPT approximations for k-median and k-means","author":"Cohen-Addad","year":"2019"},{"key":"10.1016\/j.ic.2026.105457_bib0016","series-title":"Proc. 46th Int. Colloq. Autom. Lang. Program.","first-page":"41:1","article-title":"On the fixed-parameter tractability of capacitated clustering","volume":"132","author":"Cohen-Addad","year":"2019"},{"key":"10.1016\/j.ic.2026.105457_bib0017","series-title":"Proceedings of the 5th ACM Conference on Fairness, Accountability, and Transparency","first-page":"814","article-title":"Fair representation clustering with several protected classes","author":"Dai","year":"2022"},{"issue":"4","key":"10.1016\/j.ic.2026.105457_bib0018","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1007\/s00453-019-00616-2","article-title":"A unified framework for clustering constrained data without locality property","volume":"82","author":"Ding","year":"2020","journal-title":"Algorithmica"},{"key":"10.1016\/j.ic.2026.105457_bib0019","series-title":"Proc. 40th Int. Conf. Mach. Learn.","first-page":"9689","article-title":"The fast Johnson-Lindenstrauss transform is even faster","volume":"202","author":"Fandina","year":"2023"},{"key":"10.1016\/j.ic.2026.105457_bib0020","series-title":"Proc. 43rd Int. Colloq. Autom. Lang. Program.","first-page":"75:1","article-title":"Tight analysis of a multiple-swap heurstic for budgeted red-blue median","volume":"55","author":"Friggstad","year":"2016"},{"key":"10.1016\/j.ic.2026.105457_bib0021","unstructured":"A. Gadekar, S. Thejaswi, Capacitated fair-range clustering: Hardness and approximation algorithms, CoRR abs\/2505.15905."},{"key":"10.1016\/j.ic.2026.105457_bib0022","series-title":"Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency","first-page":"438","article-title":"Socially fair k-means clustering","author":"Ghadiri","year":"2021"},{"key":"10.1016\/j.ic.2026.105457_bib0023","series-title":"Proceeding of the 29th IEEE International Conference on Robotics and Automation","first-page":"3490","article-title":"Efficient on-line data summarization using extremum summaries","author":"Girdhar","year":"2012"},{"key":"10.1016\/j.ic.2026.105457_bib0024","series-title":"Proceedings of the 34th ACM-SIAM Symposium on Discrete Algorithms","first-page":"987","article-title":"Improved bi-point rounding algorithms and a golden barrier for k-median","author":"Gowda","year":"2023"},{"key":"10.1016\/j.ic.2026.105457_bib0025","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipl.2023.106383","article-title":"Tight FPT approximation for socially fair clustering","volume":"182","author":"Goyal","year":"2023","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.ic.2026.105457_bib0026","series-title":"Proceeding of the 44th Symposium on Foundations of Computer Science","first-page":"534","article-title":"Bounded geometries, fractals, and low-distortion embeddings","author":"Gupta","year":"2003"},{"key":"10.1016\/j.ic.2026.105457_bib0027","series-title":"Proc. 18th Annu. Eur. Symp. Algorithms","first-page":"314","article-title":"Budgeted red-blue median and its generalizations","volume":"6346","author":"Hajiaghayi","year":"2010"},{"issue":"4","key":"10.1016\/j.ic.2026.105457_bib0028","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/s00453-011-9547-9","article-title":"Local search algorithms for the red-blue median problem","volume":"63","author":"Hajiaghayi","year":"2012","journal-title":"Algorithmica"},{"issue":"5","key":"10.1016\/j.ic.2026.105457_bib0029","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1137\/S0097539704446281","article-title":"Fast construction of nets in low-dimensional metrics and their applications","volume":"35","author":"Har-Peled","year":"2006","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ic.2026.105457_bib0030","series-title":"Proc. 40th Int. Conf. Mach. Learn.","first-page":"13270","article-title":"Approximation algorithms for fair range clustering","volume":"202","author":"Hotegni","year":"2023"},{"key":"10.1016\/j.ic.2026.105457_bib0031","series-title":"Proceedings of the 11th International Conference on Learning Representations","article-title":"Near-optimal coresets for robust clustering","author":"Huang","year":"2023"},{"issue":"1","key":"10.1016\/j.ic.2026.105457_bib0032","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/s00453-013-9833-9","article-title":"A simple D2-sampling based PTAS for k-means and other clustering problems","volume":"70","author":"Jaiswal","year":"2014","journal-title":"Algorithmica"},{"key":"10.1016\/j.ic.2026.105457_bib0033","series-title":"Proc. 15th Innov. Theor. Comput. Sci. Conf.","first-page":"65:1","article-title":"FPT approximation for capacitated sum of radii","volume":"287","author":"Jaiswal","year":"2024"},{"key":"10.1016\/j.ic.2026.105457_bib0034","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","article-title":"Extensions of Lipschitz mappings into a Hilbert space","volume":"26","author":"Johnson","year":"1984","journal-title":"Contemp. Math."},{"key":"10.1016\/j.ic.2026.105457_bib0035","series-title":"Proceedings of the 1st Symposium on Foundations of Responsible Computing","first-page":"5:1","article-title":"Service in your neighborhood: Fairness in center location","author":"Jung","year":"2020"},{"key":"10.1016\/j.ic.2026.105457_bib0036","series-title":"Proceedings of the 33rd Annual ACM Conference on Human Factors in Computing Systems","first-page":"3819","article-title":"Unequal representation and gender stereotypes in image search results for occupations","author":"Kay","year":"2015"},{"key":"10.1016\/j.ic.2026.105457_bib0037","series-title":"Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"1117","article-title":"The matroid median problem","author":"Krishnaswamy","year":"2011"},{"key":"10.1016\/j.ic.2026.105457_bib0038","series-title":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","first-page":"646","article-title":"Constant approximation for k-median and k-means with outliers via iterative rounding","author":"Krishnaswamy","year":"2018"},{"issue":"2","key":"10.1016\/j.ic.2026.105457_bib0039","doi-asserted-by":"crossref","first-page":"5:1","DOI":"10.1145\/1667053.1667054","article-title":"Linear-time approximation schemes for clustering problems in any dimensions","volume":"57","author":"Kumar","year":"2010","journal-title":"J. ACM"},{"key":"10.1016\/j.ic.2026.105457_bib0040","series-title":"Proc. 38th Int. Colloq. Autom. Lang. Program.","first-page":"77","article-title":"A 1.488 approximation algorithm for the uncapacitated facility location problem","volume":"6756","author":"Li","year":"2011"},{"key":"10.1016\/j.ic.2026.105457_bib0041","series-title":"Proc. 37th Int. Conf. Mach. Learn.","first-page":"6586","article-title":"Individual fairness for k-clustering","volume":"119","author":"Mahabadi","year":"2020"},{"key":"10.1016\/j.ic.2026.105457_bib0042","series-title":"Proc. 34th Conf. Learn. Theory","first-page":"3246","article-title":"Approximation algorithms for socially fair clustering","volume":"134","author":"Makarychev","year":"2021"},{"key":"10.1016\/j.ic.2026.105457_bib0043","series-title":"Proc. 47th Int. Colloq. Autom. Lang. Program.","first-page":"85:1","article-title":"Proportionally fair clustering revisited","volume":"168","author":"Micha","year":"2020"},{"issue":"2","key":"10.1016\/j.ic.2026.105457_bib0044","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/(SICI)1097-4571(1999)50:2<151::AID-ASI6>3.0.CO;2-I","article-title":"Abstracting of legal cases: the potential of clustering based on the selection of representative objects","volume":"50","author":"Moens","year":"1999","journal-title":"J. Am Soc. Inf. Sci."},{"key":"10.1016\/j.ic.2026.105457_bib0045","series-title":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","first-page":"1064","article-title":"Optimal terminal dimensionality reduction in Euclidean space","author":"Narayanan","year":"2019"},{"key":"10.1016\/j.ic.2026.105457_bib0046","series-title":"Proceedings of the 34th Annual Conference on Neural Information Processing Systems","first-page":"13340","article-title":"Better algorithms for individually fair k-clustering","author":"Negahbani","year":"2021"},{"key":"10.1016\/j.ic.2026.105457_bib0047","series-title":"Proc. 17th Int. Workshop Approx. Algorithms Comb. Optim. Probl. 18th Int. Workshop Randomization Comput.","first-page":"403","article-title":"Improved approximation algorithms for matroid and knapsack median problems and applications","volume":"28","author":"Swamy","year":"2014"},{"key":"10.1016\/j.ic.2026.105457_bib0048","unstructured":"S. Thejaswi, A. Gadekar, B. Ordozgoiti, A. Gionis, Diversity-Aware Clustering: Computational Complexity and Approximation Algorithms, CoRR abs\/2401.05502."},{"key":"10.1016\/j.ic.2026.105457_bib0049","series-title":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","first-page":"1749","article-title":"Clustering with fair-center representation: parameterized approximation algorithms and heuristics","author":"Thejaswi","year":"2022"},{"key":"10.1016\/j.ic.2026.105457_bib0050","series-title":"Proceeding of the the 32nd European Conference on Machine Learning and the 25th European Conference on Principles and Practice of Knowledge Discovery in Databases","first-page":"765","article-title":"Diversity-aware k-median: Clustering with fair center representation","author":"Thejaswi","year":"2021"},{"key":"10.1016\/j.ic.2026.105457_bib0051","series-title":"Proc. 25th Int. Conf. Artif. Intell. Stat.","first-page":"8758","article-title":"Improved approximation algorithms for individually fair clustering","volume":"151","author":"Vakilian","year":"2022"},{"key":"10.1016\/j.ic.2026.105457_bib0052","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2023.114332","article-title":"Approximation algorithms for fair k-median problem without fairness violation","volume":"985","author":"Wu","year":"2024","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2026.105457_bib0053","doi-asserted-by":"crossref","DOI":"10.1016\/j.ic.2025.105343","article-title":"Towards a theoretical understanding of why local search works for clustering with fair-center representation","volume":"307","author":"Zhang","year":"2025","journal-title":"Inf. Comput."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540126000544?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540126000544?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T22:26:16Z","timestamp":1783376776000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540126000544"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":53,"alternative-id":["S0890540126000544"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2026.105457","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Parameterized approximation schemes for fair-range clustering","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ic.2026.105457","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"105457"}}