{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T15:22:53Z","timestamp":1783092173513,"version":"3.54.6"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100002822","name":"Central South University","doi-asserted-by":"publisher","award":["2023QYJC023"],"award-info":[{"award-number":["2023QYJC023"]}],"id":[{"id":"10.13039\/501100002822","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002822","name":"Central South University","doi-asserted-by":"publisher","award":["181\\u2013193"],"award-info":[{"award-number":["181\\u2013193"]}],"id":[{"id":"10.13039\/501100002822","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":["62502545"],"award-info":[{"award-number":["62502545"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.tcs.2026.116001","type":"journal-article","created":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T23:39:42Z","timestamp":1777333182000},"page":"116001","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Efficient coreset construction algorithm for fair k-median of lines"],"prefix":"10.1016","volume":"1077","author":[{"given":"Ting","family":"Liang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoliang","family":"Wu","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":[{"issue":"1","key":"10.1016\/j.tcs.2026.116001_bib0001","first-page":"1865","article-title":"Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty","volume":"14","author":"Pan","year":"2013","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"10.1016\/j.tcs.2026.116001_bib0002","doi-asserted-by":"crossref","first-page":"1979","DOI":"10.1016\/j.eswa.2011.08.045","article-title":"Customer grouping for better resources allocation using GA based clustering technique","volume":"39","author":"Ho","year":"2012","journal-title":"Expert Syst. Appl."},{"issue":"15","key":"10.1016\/j.tcs.2026.116001_bib0003","doi-asserted-by":"crossref","first-page":"3003","DOI":"10.1080\/014311698214398","article-title":"Image classification algorithm based on the RBF neural network and K-means","volume":"19","author":"Rollet","year":"1998","journal-title":"Int. J. Remote Sens."},{"key":"10.1016\/j.tcs.2026.116001_bib0004","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10618-009-0135-4","article-title":"Solving large p-median clustering problems by primal\u2013dual variable neighborhood search","volume":"19","author":"Hansen","year":"2009","journal-title":"Data Min. Knowl. Discov."},{"issue":"1","key":"10.1016\/j.tcs.2026.116001_bib0005","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s004540010019","article-title":"On approximate geometric k-clustering","volume":"24","author":"Matou\u0161ek","year":"2000","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"10.1016\/j.tcs.2026.116001_bib0006","doi-asserted-by":"crossref","first-page":"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.tcs.2026.116001_bib0007","series-title":"Proceedings of the 33rd International Conference on Neural Information Processing Systems","first-page":"12817","article-title":"k-means clustering of lines for big data","author":"Marom","year":"2019"},{"issue":"1","key":"10.1016\/j.tcs.2026.116001_bib0008","first-page":"1","article-title":"Approximating (k, \u2113)-median clustering for polygonal curves","volume":"19","author":"Buchin","year":"2023","journal-title":"ACM Trans. Algo."},{"key":"10.1016\/j.tcs.2026.116001_bib0009","series-title":"Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data","first-page":"1855","article-title":"k-shape: efficient and accurate clustering of time series","author":"Paparrizos","year":"2015"},{"key":"10.1016\/j.tcs.2026.116001_bib0010","series-title":"Proceedings of the 12th International Conference on Computer Vision","first-page":"484","article-title":"Multi-scale object detection by clustering lines","author":"Ommer","year":"2009"},{"key":"10.1016\/j.tcs.2026.116001_bib0011","series-title":"Clustering of Lines","author":"Perets","year":"2011"},{"key":"10.1016\/j.tcs.2026.116001_bib0012","series-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems","first-page":"5036","article-title":"Fair clustering through fairlets","author":"Chierichetti","year":"2017"},{"key":"10.1016\/j.tcs.2026.116001_bib0013","series-title":"Proceedings of the 22nd International Conference on Approximation Algorithms for Combinatorial Optimization Problems and 23rd International Conference on Randomization and Computation","first-page":"18:1","article-title":"On the cost of essentially fair clusterings","author":"Bercea","year":"2019"},{"key":"10.1016\/j.tcs.2026.116001_bib0014","series-title":"Proceedings of the 33rd International Conference on Neural Information Processing Systems","first-page":"4954","article-title":"Fair algorithms for clustering","author":"Bera","year":"2019"},{"key":"10.1016\/j.tcs.2026.116001_bib0015","series-title":"Proceedings of the 36th International Conference on Neural Information Processing Systems","first-page":"37363","article-title":"Coreset for line-sets clustering","author":"Lotan","year":"2022"},{"key":"10.1016\/j.tcs.2026.116001_bib0016","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s00454-008-9107-5","article-title":"Analysis of incomplete data and an intrinsic-dimension helly theorem","volume":"40","author":"Gao","year":"2008","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"10.1016\/j.tcs.2026.116001_bib0017","first-page":"1","article-title":"Clustering lines in high-dimensional space: classification of incomplete data","volume":"7","author":"Gao","year":"2010","journal-title":"ACM Trans. Algo."},{"key":"10.1016\/j.tcs.2026.116001_bib0018","series-title":"Proceedings of the 17th International Workshop on Approximation and Online Algorithms","first-page":"232","article-title":"Fair coresets and streaming algorithms for fair k-means","author":"Schmidt","year":"2020"},{"key":"10.1016\/j.tcs.2026.116001_bib0019","series-title":"Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"1343","article-title":"Data reduction for weighted and outlier-resistant clustering","author":"Feldman","year":"2012"},{"key":"10.1016\/j.tcs.2026.116001_bib0020","unstructured":"I. Jubran, D. Feldman, Minimizing sum of non-convex but piecewise log-Lipschitz functions using coresets, arXiv: 1807.08446(2018)."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002513?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002513?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T15:02:58Z","timestamp":1783090978000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002513"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":20,"alternative-id":["S0304397526002513"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116001","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient coreset construction algorithm for fair k-median of lines","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"116001"}}