Login / Signup

Approximating Geometric Knapsack via L-Packings.

Waldo GálvezFabrizio GrandoniSandy HeydrichSalvatore IngalaArindam KhanAndreas Wiese
Published in: FOCS (2017)
Keyphrases
  • packing problem
  • knapsack problem
  • dynamic programming
  • geometric constraints
  • feasible solution
  • databases
  • optimal solution
  • search algorithm
  • upper bound
  • neural network
  • level set
  • geometric structure
  • multiple choice