Approximating the Geometric Knapsack Problem in Near-Linear Time and
Dynamically
Approximating the Geometric Knapsack Problem in Near-Linear Time and
Dynamically
An important goal in algorithm design is determining the best running time for solving a problem (approximately). For some problems, we know the optimal running time, assuming certain conditional lower bounds. In this work, we study the $d$-dimensional geometric knapsack problem where we are far from this level of understanding. …