Research map / Learning theory and algorithms / Fairness
Fairness in Streaming Submodular Maximization: Algorithms and Hardness
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Improved Algorithms for Fair Matroid Submodular Maximization (NeurIPS 2025 · similarity 0.88)
- Deletion-Robust Submodular Maximization with Knapsack Constraints (AAAI 2024 · similarity 0.88)
- Online and Streaming Algorithms for Constrained k-Submodular Maximization (AAAI 2025 · similarity 0.88)
- Streaming Stochastic Submodular Maximization with On-Demand User Requests (NeurIPS 2025 · similarity 0.88)
- Fair Submodular Cover (ICLR 2025 · similarity 0.87)
- Bridging Jensen Gap for Max-Min Group Fairness Optimization in Recommendation (ICLR 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.