We analyze the proportional online knapsack problem with removal and limited recourse.
The input is a sequence of item sizes; a subset of the items has to be packed into a …

In the online knapsack problem, the goal is to pack items arriving online with different values
and weights into a capacity-limited knapsack to maximize the total value of the accepted …

In light of the conspicuous lack of clear progress toward resolving the question of P versus
NP, this dissertation explores four adjacent topics. The first contribution is the introduction of …

The well-known classical version of the online knapsack problem decides which of the
arriving items of different weights and values to accept into a capacity-limited knapsack. In …

This thesis studies three topics in online computing. In the first topic, we regard a problem as
being online that is usually only considered to be offline. In the second topic, we tighten the …