Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Online Knapsack Problems with a Resource Buffer   In this paper, we introduce online knapsack problems with a resource buffer.
In the problems, we are given a knapsack with capacity $1$, a buffer with
capacity $R\ge 1$, and items that arrive one by one. Each arriving item has to
be taken into the buffer or discarded on its arrival irrevocably. When every
item has arrived, we transfer a subset of items in the current buffer into the
knapsack. Our goal is to maximize the total value of the items in the knapsack.
We consider four variants depending on whether items in the buffer are
removable (i.e., we can remove items in the buffer) or non-removable, and
proportional (i.e., the value of each item is proportional to its size) or
general. For the general&non-removable case, we observe that no constant
competitive algorithm exists for any $R\ge 1$. For the
proportional&non-removable case, we show that a simple greedy algorithm is
optimal for every $R\ge 1$. For the general&removable and the
proportional&removable cases, we present optimal algorithms for small $R$ and
give asymptotically nearly optimal algorithms for general $R$.

34
The categories of this paper are: chem-ph
4
The categories of this paper are: cond-mat
21
The categories of this paper are: adap-org
6
The categories of this paper are: astro-ph
17
The categories of this paper are: q-fin
24
The categories of this paper are: dg-ga
7
The categories of this paper are: hep-th
9
The categories of this paper are: nlin
19
The categories of this paper are: eess
3
The categories of this paper are: physics
8
The categories of this paper are: hep-ex
12
The categories of this paper are: nucl-th
35
The categories of this paper are: mtrl-th
33
The categories of this paper are: plasm-ph
18
The categories of this paper are: econ
2
The categories of this paper are: math