Fair maximization of monotone submodular functions in data streams

DOI10.1007/978-981-96-4445-2_24MaRDI QIDQ6909226zbMATH OpenFDO

Authors Shuqian Zhu, Longkun Guo, Jiawei Lin

Publication date 29 October 2025

Full work available at URL https://doi.org/10.1007/978-981-96-4445-2_24

zbMATH Keywords

approximation algorithmfairnessstreamingsubmodular maximization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

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
• 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
• Streaming submodular maximization under matroid constraints
• 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: Fair maximization of monotone submodular functions in data streams

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