{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T22:14:59Z","timestamp":1770416099402,"version":"3.49.0"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:00:00Z","timestamp":1770336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:00:00Z","timestamp":1770336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1007\/s11704-025-50627-2","type":"journal-article","created":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T11:16:51Z","timestamp":1770376611000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning-augmented approximation algorithms for group fair k-center clustering"],"prefix":"10.1007","volume":"20","author":[{"given":"Xiaoliang","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junyu","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,6]]},"reference":[{"key":"50627_CR1","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T F Gonzalez","year":"1985","unstructured":"Gonzalez T F. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 1985, 38: 293\u2013306","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"50627_CR2","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"D S Hochbaum","year":"1985","unstructured":"Hochbaum D S, Shmoys D B. A best possible heuristic for the k-center problem. Mathematics of Operations Research, 1985, 10(2): 180\u2013184","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"50627_CR3","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0166-218X(79)90044-1","volume":"1","author":"W L Hsu","year":"1979","unstructured":"Hsu W L, Nemhauser G L. Easy and hard bottleneck location problems. Discrete Applied Mathematics, 1979, 1(3): 209\u2013215","journal-title":"Discrete Applied Mathematics"},{"key":"50627_CR4","first-page":"5036","volume-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems","author":"F Chierichetti","year":"2017","unstructured":"Chierichetti F, Kumar R, Lattanzi S, Vassilvitskii S. Fair clustering through fairlets. In: Proceedings of the 31st International Conference on Neural Information Processing Systems. 2017, 5036\u20135044"},{"key":"50627_CR5","volume-title":"Proceedings of the 10th International Conference on Learning Representations","author":"J C Ergun","year":"2022","unstructured":"Ergun J C, Feng Z, Silwal S, Woodruff D, Zhou S. Learning-augmented k-means clustering. In: Proceedings of the 10th International Conference on Learning Representations. 2022"},{"key":"50627_CR6","volume-title":"Proceedings of the 11th International Conference on Learning Representations","author":"T D Nguyen","year":"2023","unstructured":"Nguyen T D, Chaturvedi A, Nguyen H L. Improved learning-augmented algorithms for k-means and k-medians clustering. In: Proceedings of the 11th International Conference on Learning Representations. 2023"},{"key":"50627_CR7","first-page":"18:1","volume-title":"Proceedings of the 23rd Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"I O Bercea","year":"2019","unstructured":"Bercea I O, Gro\u00df M, Khuller S, Kumar A, R\u00f6sner C, Schmidt D R, Schmidt M. On the cost of essentially fair clusterings. In: Proceedings of the 23rd Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. 2019, 18:1\u201318:22"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-025-50627-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-025-50627-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-025-50627-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T11:16:52Z","timestamp":1770376612000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-025-50627-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,6]]},"references-count":7,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["50627"],"URL":"https:\/\/doi.org\/10.1007\/s11704-025-50627-2","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,6]]},"assertion":[{"value":"15 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests or financial conflicts to disclose.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"2010408"}}