Fair Submodular Maximization over a Knapsack Constraint

Documenti analoghi

• Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint
  di: Hao, Yimin, et al.
  Pubblicazione: (2025)
• Logarithmic Approximations for Fair k-Set Selection
  di: Li, Shi, et al.
  Pubblicazione: (2025)
• Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
  di: Amanatidis, Georgios, et al.
  Pubblicazione: (2020)
• Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint
  di: Klimm, Max, et al.
  Pubblicazione: (2022)
• Fairness in Streaming Submodular Maximization over a Matroid Constraint
  di: Halabi, Marwa El, et al.
  Pubblicazione: (2023)