## Approximation algorithms for knapsack problems with cardinality constraints

- Alberto Caprara, Hans Kellerer, Ulrich Pferschy, David Pisinger
- European Journal of Operational Research
- 2000

Highly Influential

10 Excerpts

- Published 2001 in FCT

We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of rounding techniques yield novel and powerful ways of rounding. As an application of these techniques, we present a faster polynomial time approximation scheme requiring only linear storage, that computes an approximate solution of any xed accuracy in linear time. This linear complexity bound gives a substantial improvement of the best previously known polynomial bound 2].

@inproceedings{Mastrolilli2001CombiningAA,
title={Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems},
author={Monaldo Mastrolilli},
booktitle={FCT},
year={2001}
}