Streaming submodular maximization with fairness constraints for massive data summarization

DOI10.1016/J.TCS.2026.116037MaRDI QIDQ7294921zbMATH OpenFDO

Authors Longkun Guo, Jiawei Lin, Shuqian Zhu

Publication date 13 July 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116037

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A threshold of ln n for approximating set cover
• An analysis of approximations for maximizing submodular set functions—I
• Better streaming algorithms for the maximum coverage problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• scientific article; zbMATH DE number 3635849 (Why is no real title available?)
• scientific article; zbMATH DE number 7758364 (Why is no real title available?)
• Online maximum \(k\)-coverage
• Online submodular maximization with free disposal: randomization beats \(\frac{1}{4}\) for partition matroids
• Random sampling with a reservoir
• Ranked document selection
• Scalable influence maximization for independent cascade model in large-scale social networks
• Streaming algorithms for submodular function maximization
• Submodular maximization meets streaming: matchings, matroids, and more
• Tight bounds for single-pass streaming complexity of the set cover problem

This page was built for publication: Streaming submodular maximization with fairness constraints for massive data summarization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294921)