# A note on "Approximation schemes for a subclass of subset selection problems", and a faster FPTAS for the Minimum Knapsack Problem

arXiv: https://arxiv.org/abs/1607.07950 · HTML: https://mlsanity.com/paper/1607.07950/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 27 Jul 2016.

## Built on by (most cited first, 1 of 1)

- [A Fully Polynomial Time Approximation Scheme for Constrained MDPs and Stochastic Shortest Path under Local Transitions](https://mlsanity.com/paper/2204.04780/) (2022)

## Abstract (arXiv)

Pruhs and Woeginger prove the existence of FPTAS's for a general class of minimization and maximization subset selection problems. Without losing generality from the original framework, we prove how better asymptotic worst-case running times can be achieved if a ρ-approximation algorithm is available, and in particular we obtain matching running times between maximization and minimization subset selection problems. We directly apply this result to the Minimum Knapsack Problem, for which the original framework yields an FPTAS with running time O(n5/ε), where ε is the required accuracy and n is the number of items, and obtain an FPTAS with running time O(n3/ε), thus improving the running time by a quadratic factor in the worst case.