research
∙
08/15/2023
A Nearly Quadratic-Time FPTAS for Knapsack
We investigate polynomial-time approximation schemes for the classic 0-1...
research
∙
07/24/2023
Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results
We investigate pseudopolynomial-time algorithms for Bounded Knapsack and...
research
∙
05/15/2019