Fast Additive Constant Approximation Algorithms for the Safe Deposit Boxes Problem with Two and Three Currencies


The following variant of the knapsack problem is considered; Suppose there are n safe deposit boxes, each containing known amounts of m currencies, and there is a certain need for each currency. The problem is to open the minimal number of boxes, in order to collect at least the prescribed amount of each currency. In a technical report, by Y. Dinitz and A… (More)


3 Figures and Tables

Slides referencing similar topics