Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint

Documenti analoghi

• Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
  di: Amanatidis, Georgios, et al.
  Pubblicazione: (2021)
• Algorithmically Fair Maximization of Multiple Submodular Objective Functions
  di: Amanatidis, Georgios, et al.
  Pubblicazione: (2024)
• Deletion Robust Non-Monotone Submodular Maximization over Matroids
  di: Dütting, Paul, et al.
  Pubblicazione: (2022)
• Efficient Two-Sided Markets with Limited Information
  di: Dütting, Paul, et al.
  Pubblicazione: (2020)
• Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint
  di: Chen, Yixin, et al.
  Pubblicazione: (2020)