Login / Signup

Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings.

Vanja DoskocTobias FriedrichAndreas GöbelAneta NeumannFrank NeumannFrancesco Quinzan
Published in: ECAI (2020)
Keyphrases
  • objective function
  • dynamic programming
  • greedy algorithm
  • knapsack problem
  • real time
  • databases
  • upper bound
  • multi agent
  • pairwise
  • boolean functions