Stealing From the Dragon's Hoard: Online Unbounded Knapsack With Removal
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
Abstract
We introduce the Online Unbounded Knapsack Problem with Removal, a variation of the well-known Online Knapsack Problem. Items, each with a weight and value, arrive online and an algorithm must decide on whether or not to pack them into a knapsack with a fixed weight limit. An item may be packed an arbitrary number of times and items may be removed from the knapsack at any time without cost. The goal is to maximize the total value of items packed, while respecting a weight limit. We show that this is one of the very few natural online knapsack variants that allow for competitive deterministic algorithms in the general setting, by providing an algorithm with competitivity 1.6911. We complement this with a lower bound of 1.5877. We also analyze the proportional setting, where the weight and value of any single item agree, and show that deterministic algorithms can be exactly 3/2-competitive. Lastly, we give lower and upper bounds of 6/5 and 4/3 on the competitivity of randomized algorithms in this setting.
Authors 3
-
University of Southern Denmark
Affiliation as printed
Department of Mathematics and Computer Science , Syddansk Universitet , Denmark
-
Affiliation as printed
Department of Computer Science , RWTH Aachen University , Germany
-
Affiliation as printed
Department of Computer Science , ETH Zurich , Switzerland
Cited by 0 stored of 0
No patents citing this paper on Lens.org (checked 2026-10-06).