{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T22:15:24Z","timestamp":1778537724933,"version":"3.51.4"},"reference-count":40,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"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":["12571342"],"award-info":[{"award-number":["12571342"]}],"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":["U20A2068"],"award-info":[{"award-number":["U20A2068"]}],"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,3]]},"DOI":"10.1016\/j.tcs.2025.115722","type":"journal-article","created":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T16:21:38Z","timestamp":1767025298000},"page":"115722","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Approximation algorithm for fair stochastic maximum coverage problem"],"prefix":"10.1016","volume":"1065","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-3789-9872","authenticated-orcid":false,"given":"Mingchao","family":"Zhou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4191-7598","authenticated-orcid":false,"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/j.tcs.2025.115722_bib0001","doi-asserted-by":"crossref","first-page":"3999","DOI":"10.1287\/mnsc.2022.00930","article-title":"Fair allocation of vaccines, ventilators and antiviral treatments: leaving no ethical value behind in healthcare rationing","volume":"70","author":"Pathak","year":"2024","journal-title":"Manage. Sci."},{"issue":"8","key":"10.1016\/j.tcs.2025.115722_bib0002","doi-asserted-by":"crossref","first-page":"6800","DOI":"10.1109\/LRA.2024.3412590","article-title":"Node placement and path planning for improved area coverage in mixed wireless sensor networks","volume":"9","author":"Kumari","year":"2024","journal-title":"IEEE Rob. Autom. Lett."},{"issue":"3","key":"10.1016\/j.tcs.2025.115722_bib0003","doi-asserted-by":"crossref","DOI":"10.1145\/3547333","article-title":"A survey on the fairness of recommender systems","volume":"41","author":"Wang","year":"2023","journal-title":"ACM Trans. Inf. Syst."},{"issue":"4","key":"10.1016\/j.tcs.2025.115722_bib0004","doi-asserted-by":"crossref","first-page":"1674","DOI":"10.1287\/opre.2022.2432","article-title":"Best of both worlds: ex ante and ex post fairness in resource allocation","volume":"72","author":"Aziz","year":"2024","journal-title":"Oper. Res."},{"key":"10.1016\/j.tcs.2025.115722_bib0005","series-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","first-page":"72","article-title":"Maximum coverage problem with group budget constraints and applications","author":"Chekuri","year":"2004"},{"issue":"4","key":"10.1016\/j.tcs.2025.115722_bib0006","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","article-title":"A threshold of ln\u2009n for approximating set cover","volume":"45","author":"Feige","year":"1998","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/j.tcs.2025.115722_bib0007","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/s10878-024-01166-2","article-title":"Approximation algorithms for maximum weighted target cover problem with distance limitations","volume":"47","author":"Jin","year":"2024","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2025.115722_bib0008","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"},{"issue":"2","key":"10.1016\/j.tcs.2025.115722_bib0009","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.orl.2022.02.003","article-title":"Approximation algorithm for the stochastic prize-collecting set multicover problem","volume":"50","author":"Takazawa","year":"2022","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"10.1016\/j.tcs.2025.115722_bib0010","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","article-title":"Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem","volume":"7","author":"Conforti","year":"1984","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"10.1016\/j.tcs.2025.115722_bib0011","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/261342.571216","article-title":"Approximation algorithms for NP-hard problems","volume":"28","author":"Hochba","year":"1997","journal-title":"SIGACT News"},{"key":"10.1016\/j.tcs.2025.115722_bib0012","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1023\/B:JOCO.0000038913.96607.c2","article-title":"Pipage rounding: a new method of constructing algorithms with proven performance guarantee","volume":"8","author":"Ageev","year":"2004","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2025.115722_bib0013","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.tcs.2019.02.015","article-title":"Efficient approximation algorithms for maximum coverage with group budget constraints","volume":"788","author":"Guo","year":"2019","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2025.115722_bib0014","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1007\/s10878-016-0102-0","article-title":"Maximum coverage problem with group budget constraints","volume":"34","author":"Farbstein","year":"2017","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2025.115722_bib0015","series-title":"Proceedings of the 36th International Conference on Machine Learning","first-page":"1032","article-title":"Proportionally fair clustering","volume":"97","author":"Chen","year":"2019"},{"key":"10.1016\/j.tcs.2025.115722_bib0016","doi-asserted-by":"crossref","unstructured":"E. Chlamt\u00e1\u010d, Y. Makarychev, A. Vakilian, Approximating Fair Clustering with Cascaded Norm Objectives, in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2664\u20132683. 10.1137\/1.9781611977073.104.","DOI":"10.1137\/1.9781611977073.104"},{"key":"10.1016\/j.tcs.2025.115722_bib0017","series-title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI-19","first-page":"6196","article-title":"Delayed impact of fair machine learning","author":"Liu","year":"2019"},{"issue":"6","key":"10.1016\/j.tcs.2025.115722_bib0018","doi-asserted-by":"crossref","DOI":"10.1145\/3457607","article-title":"A survey on bias and fairness in machine learning","volume":"54","author":"Mehrabi","year":"2021","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"10.1016\/j.tcs.2025.115722_bib0019","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/j.ejor.2019.07.045","article-title":"On single-source capacitated facility location with cost and fairness objectives","volume":"289","author":"Filippi","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.tcs.2025.115722_bib0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105292","article-title":"A kernel search heuristic for a fair facility location problem","volume":"132","author":"Filippi","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.tcs.2025.115722_bib0021","series-title":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid \u201907)","first-page":"343","article-title":"Fair game-theoretic resource management in dedicated grids","author":"Rzadca","year":"2007"},{"key":"10.1016\/j.tcs.2025.115722_bib0022","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.tcs.2014.04.006","article-title":"Approximation algorithms for the partition vertex cover problem","volume":"555","author":"Bera","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2025.115722_bib0023","unstructured":"T. Inamdar, K. Varadarajan, On the partition set cover problem, (2018). 10.48550\/arXiv.1809.06506."},{"issue":"12","key":"10.1016\/j.tcs.2025.115722_bib0024","doi-asserted-by":"crossref","first-page":"3816","DOI":"10.1007\/s00453-023-01164-6","article-title":"On colorful vertex and edge cover problems","volume":"85","author":"Bandyapadhyay","year":"2023","journal-title":"Algorithmica"},{"issue":"3","key":"10.1016\/j.tcs.2025.115722_bib0025","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/s10878-024-01215-w","article-title":"Approximation algorithm for prize-collecting vertex cover with fairness constraints","volume":"48","author":"Zhou","year":"2024","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2025.115722_bib0026","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.dam.2025.05.010","article-title":"Approximation algorithm for prize-collecting weighted set cover with fairness constraints","volume":"373","author":"Zhou","year":"2025","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.tcs.2025.115722_bib0027","series-title":"Combinatorial Optimization and Applications","first-page":"190","article-title":"Minimum power partial cover with fairness constraint","author":"Ma","year":"2025"},{"issue":"5","key":"10.1016\/j.tcs.2025.115722_bib0028","doi-asserted-by":"crossref","first-page":"1287","DOI":"10.1007\/s00453-022-01072-1","article-title":"Maximizing coverage while ensuring fairness: a tale of conflicting objectives","volume":"85","author":"Asudeh","year":"2023","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2025.115722_bib0029","series-title":"Proceedings of the 27th International Joint Conference on Artificial Intelligence","first-page":"144","article-title":"Multiwinner voting with fairness constraints","author":"Celis","year":"2018"},{"key":"10.1016\/j.tcs.2025.115722_bib0030","series-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems","article-title":"Fairness in streaming submodular maximization: algorithms and hardness","author":"El Halabi","year":"2020"},{"key":"10.1016\/j.tcs.2025.115722_bib0031","series-title":"Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","first-page":"514","article-title":"Fairness in streaming submodular maximization subject to a knapsack constraint","author":"Cui","year":"2024"},{"key":"10.1016\/j.tcs.2025.115722_bib0032","series-title":"Fair and representative subset selection from data streams","first-page":"1340","author":"Wang","year":"2021"},{"key":"10.1016\/j.tcs.2025.115722_bib0033","series-title":"Proceedings of the 40th International Conference on Machine Learning","article-title":"Fairness in streaming submodular maximization over a matroid constraint","author":"El Halabi","year":"2023"},{"key":"10.1016\/j.tcs.2025.115722_bib0034","series-title":"Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.65109\/YWWM5554","article-title":"Group fairness for knapsack problems","author":"Patel","year":"2021"},{"issue":"1","key":"10.1016\/j.tcs.2025.115722_bib0035","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10107-005-0673-5","article-title":"Hedging uncertainty: approximation algorithms for stochastic optimization problems","volume":"108","author":"Ravi","year":"2006","journal-title":"Math. Program."},{"key":"10.1016\/j.tcs.2025.115722_bib0036","series-title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"323","article-title":"Stochastic submodular cover with limited adaptivity","author":"Agarwal","year":"2019"},{"key":"10.1016\/j.tcs.2025.115722_bib0037","series-title":"Wireless Algorithms, Systems, and Applications: 4th International Conference, WASA 2009, Boston, MA, USA, August 16\u201318, 2009. Proceedings 4","first-page":"125","article-title":"Stochastic k-coverage in wireless sensor networks","author":"Ammari","year":"2009"},{"key":"10.1016\/j.tcs.2025.115722_bib0038","series-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"1453","article-title":"Approximation algorithms for stochastic boolean function evaluation and stochastic submodular set cover","author":"Deshpande","year":"2014"},{"key":"10.1016\/j.tcs.2025.115722_bib0039","series-title":"Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"1808","article-title":"Stochastic vertex cover with few queries","author":"Behnezhad","year":"2022"},{"key":"10.1016\/j.tcs.2025.115722_bib0040","series-title":"Algorithm Design","author":"Kleinberg","year":"2006"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397525006590?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397525006590?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T21:57:22Z","timestamp":1778536642000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397525006590"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":40,"alternative-id":["S0304397525006590"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115722","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximation algorithm for fair stochastic maximum coverage problem","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115722","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115722"}}