{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T04:10:27Z","timestamp":1778818227461,"version":"3.51.4"},"reference-count":22,"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,4,16]],"date-time":"2026-04-16T00:00:00Z","timestamp":1776297600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.tcs.2026.115968","type":"journal-article","created":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T14:51:25Z","timestamp":1776523885000},"page":"115968","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Constant FPT approximation algorithms for colorful sum of radii"],"prefix":"10.1016","volume":"1076","author":[{"given":"Shuilian","family":"Liu","sequence":"first","affiliation":[]},{"given":"Gregory Z.","family":"Gutin","sequence":"additional","affiliation":[]},{"given":"Yicheng","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115968_bib0001","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02614317","article-title":"Cluster analysis and mathematical programming","volume":"79","author":"Hansen","year":"1997","journal-title":"Math. Program."},{"key":"10.1016\/j.tcs.2026.115968_bib0002","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1007\/s00453-009-9282-7","article-title":"On metric clustering to minimize the sum of radii","volume":"57","author":"Gibson","year":"2010","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.115968_bib0003","series-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"1738","article-title":"A (3+\u03b5)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds","author":"Buchem","year":"2024"},{"key":"10.1016\/j.tcs.2026.115968_bib0004","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/j.jcss.2003.07.014","article-title":"Clustering to minimize the sum of cluster diameters","volume":"68","author":"Charikar","year":"2004","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.115968_bib0005","series-title":"Proceedings of the European Symposium on Algorithms (ESA)","first-page":"1","article-title":"Improved polynomial-time approximations for clustering with minimum sum of radii or diameters","author":"Friggstad","year":"2022"},{"key":"10.1016\/j.tcs.2026.115968_bib0006","series-title":"Proceedings of the Association for the Advancement of Artificial Intelligence (AAAI)","first-page":"20666","article-title":"Parameterized approximation algorithms for sum of radii clustering and variants","author":"Chen","year":"2024"},{"key":"10.1016\/j.tcs.2026.115968_bib0007","series-title":"Proceedings of the European Symposium on Algorithms (ESA)","first-page":"1","article-title":"Capacitated sum-of-radii clustering: an FPT approximation","author":"Inamdar","year":"2020"},{"key":"10.1016\/j.tcs.2026.115968_bib0008","series-title":"Proceedings of the European Symposium on Algorithms (ESA)","first-page":"1","article-title":"A constant approximation for colorful k-center","author":"Bandyapadhyay","year":"2019"},{"key":"10.1016\/j.tcs.2026.115968_bib0009","series-title":"Proceedings of the Innovations in Theoretical Computer Science Conference (ITCS)","first-page":"1","article-title":"FPT approximation for capacitated sum of radii","author":"Jaiswal","year":"2024"},{"key":"10.1016\/j.tcs.2026.115968_bib0010","unstructured":"A. Filtser, A. Gadekar, FPT approximations for capacitated sum of radii and diameters, (2024). arXiv: 2409.04984."},{"key":"10.1016\/j.tcs.2026.115968_bib0011","series-title":"Proceedings of the Advances in Neural Information Processing Systems (NeurIPS)","first-page":"5029","article-title":"Fair clustering through fairlets","author":"Chierichetti","year":"2017"},{"key":"10.1016\/j.tcs.2026.115968_bib0012","series-title":"Proceedings of the Advances in Neural Information Processing Systems (NeurIPS)","first-page":"4955","article-title":"Fair algorithms for clustering","author":"Bera","year":"2019"},{"key":"10.1016\/j.tcs.2026.115968_bib0013","series-title":"Proceedings of the International Conference on Machine Learning (ICML)","first-page":"1032","article-title":"Proportionally fair clustering","author":"Chen","year":"2019"},{"key":"10.1016\/j.tcs.2026.115968_bib0014","series-title":"Proceedings of the ACM Conference on Fairness, Accountability, and Transparency (FAccT)","first-page":"438","article-title":"Socially fair k-means clustering","author":"Ghadiri","year":"2021"},{"key":"10.1016\/j.tcs.2026.115968_bib0015","series-title":"Proceedings of the International Symposium on Algorithms and Computation (ISAAC)","first-page":"1","article-title":"FPT approximations for fair k-min-sum-radii","author":"Carta","year":"2024"},{"key":"10.1016\/j.tcs.2026.115968_bib0016","series-title":"Proceedings of the European Symposium on Algorithms (ESA)","first-page":"1","article-title":"Polynomial-time constant-approximation for fair sum-of-radii clustering","author":"Bagheri Nezhad","year":"2025"},{"key":"10.1016\/j.tcs.2026.115968_bib0017","series-title":"Proceedings of the ACM Symposium on Theory of Computing (STOC)","first-page":"448","article-title":"An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems","author":"Gabow","year":"1983"},{"key":"10.1016\/j.tcs.2026.115968_bib0018","series-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"642","article-title":"Algorithms for facility location problems with outliers","author":"Charikar","year":"2001"},{"key":"10.1016\/j.tcs.2026.115968_bib0019","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s10107-021-01674-7","article-title":"Fair colorful k-center clustering","volume":"192","author":"Jia","year":"2022","journal-title":"Math. Program."},{"key":"10.1016\/j.tcs.2026.115968_bib0020","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-021-01645-y","article-title":"A technique for obtaining true approximations for k-center with covering constraints","volume":"192","author":"Anegg","year":"2022","journal-title":"Math. Program."},{"key":"10.1016\/j.tcs.2026.115968_bib0021","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1613\/jair.1.14883","article-title":"Clustering what matters: optimal approximation for clustering with outliers","volume":"78","author":"Agrawal","year":"2023","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.tcs.2026.115968_bib0022","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1007\/s10878-022-00874-x","article-title":"Algorithms for covering multiple submodular constraints and applications","volume":"44","author":"Chekuri","year":"2022","journal-title":"J. Comb. Optim."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002276?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002276?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T03:24:10Z","timestamp":1778815450000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002276"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":22,"alternative-id":["S0304397526002276"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115968","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Constant FPT approximation algorithms for colorful sum of radii","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115968","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115968"}}