A Nearly Quadratic-Time Deterministic Fully Polynomial-Time Approximation Scheme for the Knapsack Problem

The authors present a deterministic fully polynomial-time approximation scheme (FPTAS) for the classic Knapsack problem that runs in nearly quadratic time, which is essentially the best possible under the conjecture that (min, +)-convolution has no truly subquadratic-time algorithm.