Crossref
Streaming submodular maximization with fairness constraints for massive data summarization
Theoretical Computer Science · 2026-08 · 1081 · 116037
DOI: 10.1016/j.tcs.2026.116037 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-08. Verfasst von Longkun Guo und 2 weiteren Autor:innen. Die Arbeit nennt 31 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Fujian Province.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
- Natural Science Foundation of Fujian Province
Zitieren
APA
Guo, L., Lin, J., & Zhu, S. (2026). Streaming submodular maximization with fairness constraints for massive data summarization. Theoretical Computer Science, 1081, 116037. https://doi.org/10.1016/j.tcs.2026.116037
Vancouver
Guo L, Lin J, Zhu S. Streaming submodular maximization with fairness constraints for massive data summarization. Theoretical Computer Science. 2026;1081:116037. doi:10.1016/j.tcs.2026.116037
BibTeX
@article{Guo2026,
author = {Guo, Longkun and Lin, Jiawei and Zhu, Shuqian},
title = {Streaming submodular maximization with fairness constraints for massive data summarization},
journal = {Theoretical Computer Science},
year = {2026},
volume = {1081},
pages = {116037},
doi = {10.1016/j.tcs.2026.116037}
}
EUVIMED