{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:55:58Z","timestamp":1781463358456,"version":"3.54.1"},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.tcs.2026.116037","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T05:48:36Z","timestamp":1779428916000},"page":"116037","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Streaming submodular maximization with fairness constraints for massive data summarization"],"prefix":"10.1016","volume":"1081","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2891-4253","authenticated-orcid":false,"given":"Longkun","family":"Guo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiawei","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuqian","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116037_bib0001","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BFb0121195","article-title":"An analysis of approximations for maximizing submodular set functions II","volume":"8","author":"Fisher","year":"1978","journal-title":"Math. Program. Stud."},{"key":"10.1016\/j.tcs.2026.116037_bib0002","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10618-012-0262-1","article-title":"Scalable influence maximization for independent cascade model in large-scale social networks","volume":"25","author":"Wang","year":"2012","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.tcs.2026.116037_bib0003","series-title":"Proceedings of the Web Conference 2020","first-page":"2089","article-title":"Seeding network influence in biased networks and the benefits of diversity","author":"Stoica","year":"2020"},{"issue":"6","key":"10.1016\/j.tcs.2026.116037_bib0004","doi-asserted-by":"crossref","first-page":"1633","DOI":"10.26599\/TST.2023.9010122","article-title":"Approximation algorithms for maximization of k-submodular function under a matroid constraint","volume":"29","author":"Liu","year":"2024","journal-title":"Tsinghua Sci. Technol."},{"issue":"6","key":"10.1016\/j.tcs.2026.116037_bib0005","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.26599\/TST.2022.9010061","article-title":"Bicriteria algorithms for approximately submodular cover under streaming model","volume":"28","author":"Wang","year":"2023","journal-title":"Tsinghua Sci. Technol."},{"key":"10.1016\/j.tcs.2026.116037_bib0006","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.tcs.2019.10.008","article-title":"Ranked document selection","volume":"812","author":"Munro","year":"2020","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2026.116037_bib0007","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","article-title":"A threshold of ln n for approximating set cover","volume":"45","author":"Feige","year":"1998","journal-title":"J. ACM (JACM)"},{"key":"10.1016\/j.tcs.2026.116037_bib0008","series-title":"Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"1204","article-title":"Online submodular maximization with free disposal: randomization beats for partition matroids","author":"Chan","year":"2017"},{"key":"10.1016\/j.tcs.2026.116037_bib0009","series-title":"Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6\u201310, 2015, Proceedings, Part I 42","first-page":"318","article-title":"Streaming algorithms for submodular function maximization","author":"Chekuri","year":"2015"},{"key":"10.1016\/j.tcs.2026.116037_bib0010","doi-asserted-by":"crossref","first-page":"1595","DOI":"10.1007\/s00224-018-9878-x","article-title":"Better streaming algorithms for the maximum coverage problem","volume":"63","author":"McGregor","year":"2019","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.tcs.2026.116037_bib0011","series-title":"Proceedings of the Web Conference 2021","first-page":"1340","article-title":"Fair and representative subset selection from data streams","author":"Wang","year":"2021"},{"issue":"5","key":"10.1016\/j.tcs.2026.116037_bib0012","doi-asserted-by":"crossref","first-page":"888","DOI":"10.26599\/TST.2022.9010031","article-title":"Streaming algorithms for non-submodular maximization on the integer lattice","volume":"28","author":"Tan","year":"2023","journal-title":"Tsinghua Sci. Technol."},{"issue":"1","key":"10.1016\/j.tcs.2026.116037_bib0013","doi-asserted-by":"crossref","first-page":"76","DOI":"10.26599\/TST.2023.9010026","article-title":"Multipass streaming algorithms for regularized submodular maximization","volume":"29","author":"Gong","year":"2024","journal-title":"Tsinghua Sci. Technol."},{"issue":"CSCW","key":"10.1016\/j.tcs.2026.116037_bib0014","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3359274","article-title":"Summarizing user-generated textual content: motivation and methods for fairness in algorithmic summaries","volume":"3","author":"Dash","year":"2019","journal-title":"Proc. ACM Hum.-Comput. Interact."},{"key":"10.1016\/j.tcs.2026.116037_bib0015","series-title":"Combinatorial optimization: polyhedra and efficiency","volume":"vol. 24","author":"Schrijver","year":"2003"},{"key":"10.1016\/j.tcs.2026.116037_bib0016","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-015-0900-7","article-title":"Submodular maximization meets streaming: matchings, matroids, and more","volume":"154","author":"Chakrabarti","year":"2015","journal-title":"Math. Program."},{"key":"10.1016\/j.tcs.2026.116037_bib0017","article-title":"Do less, get more: streaming submodular maximization with subsampling","volume":"31","author":"Feldman","year":"2018","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.tcs.2026.116037_bib0018","series-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2020)","article-title":"Improved multi-pass streaming algorithms for submodular maximization with matroid constraints","author":"Huang","year":"2020"},{"key":"10.1016\/j.tcs.2026.116037_bib0019","series-title":"49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)","first-page":"59:1","article-title":"Streaming submodular maximization under matroid constraints","volume":"vol. 229","author":"Feldman","year":"2022"},{"key":"10.1016\/j.tcs.2026.116037_bib0020","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","article-title":"An analysis of approximations for maximizing submodular set functions I","volume":"14","author":"Nemhauser","year":"1978","journal-title":"Math. Program."},{"key":"10.1016\/j.tcs.2026.116037_bib0021","series-title":"Proceedings of the 2009 SIAM International Conference on Data Mining","first-page":"697","article-title":"On maximum coverage in the streaming model & application to multi-topic blog-watch","author":"Saha","year":"2009"},{"issue":"13\u201314","key":"10.1016\/j.tcs.2026.116037_bib0022","doi-asserted-by":"crossref","first-page":"1901","DOI":"10.1016\/j.dam.2012.04.005","article-title":"Online maximum k-coverage","volume":"160","author":"Ausiello","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.116037_bib0023","series-title":"Proceedings of the 2013 SIAM International Conference on Data Mining","first-page":"758","article-title":"Set coverage problems in a one-pass data stream","author":"Yu","year":"2013"},{"key":"10.1016\/j.tcs.2026.116037_bib0024","series-title":"Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"671","article-title":"Streaming submodular maximization: massive data summarization on the fly","author":"Badanidiyuru","year":"2014"},{"key":"10.1016\/j.tcs.2026.116037_bib0025","series-title":"Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing","first-page":"698","article-title":"Tight bounds for single-pass streaming complexity of the set cover problem","author":"Assadi","year":"2016"},{"issue":"1","key":"10.1016\/j.tcs.2026.116037_bib0026","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/3147.3165","article-title":"Random sampling with a reservoir","volume":"11","author":"Vitter","year":"1985","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"10.1016\/j.tcs.2026.116037_bib0027","series-title":"SNAP Datasets: Stanford Large Network Dataset Collection","author":"Leskovec","year":"2014"},{"issue":"4","key":"10.1016\/j.tcs.2026.116037_bib0028","first-page":"1","article-title":"The movielens datasets: history and context","volume":"5","author":"Harper","year":"2015","journal-title":"ACM Trans. Interact. Intell. Syst. (TIIS)"},{"key":"10.1016\/j.tcs.2026.116037_bib0029","article-title":"Streaming robust submodular maximization: a partitioned thresholding approach","volume":"30","author":"Mitrovic","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.tcs.2026.116037_bib0030","series-title":"In Proceedings of the International Conference on Machine Learning 2018","first-page":"3829","article-title":"Beyond 1\/2-approximation for submodular maximization on massive data streams","author":"Norouzi-Fard","year":"2018"},{"issue":"6","key":"10.1016\/j.tcs.2026.116037_bib0031","doi-asserted-by":"crossref","first-page":"1336","DOI":"10.1109\/TKDE.2012.51","article-title":"Nonnegative matrix factorization: a comprehensive review","volume":"25","author":"Wang","year":"2012","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002872?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002872?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:12:53Z","timestamp":1781460773000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002872"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":31,"alternative-id":["S0304397526002872"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116037","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Streaming submodular maximization with fairness constraints for massive data summarization","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116037","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":"116037"}}