A Polynomial-Time Approximation Scheme for the Geometric Knapsack Problem with Hyperspheres and Fat Objects

The authors present a framework that yields polynomial-time approximation schemes (PTAS) for the geometric knapsack problem, supporting a wide range of shapes for the items and the bins, including hyperspheres and convex fat objects.