Login / Signup

Knapsack Secretary with Bursty Adversary.

Thomas KesselheimMarco Molinaro
Published in: ICALP (2020)
Keyphrases
  • knapsack problem
  • dynamic programming
  • packing problem
  • upper bound
  • network traffic
  • feasible solution
  • greedy heuristic
  • optimal solution
  • email
  • cost function
  • multiple choice
  • stackelberg game