The author presents efficient algorithms for approximating geometric knapsack problems with near-linear running times, significantly improving existing methods.
