# A Competitive Analysis of Online Knapsack Problems with Unit Density

We study an online knapsack problem where the items arrive sequentially and must be either immediately packed into the knapsack or irrevocably discarded. Each item has a different size and the objective is to maximize the total size of items packed. While the competitive ratio of deterministic algorithms for this problem is known to be 0, the competitive ratio of randomized algorithms has, surprisingly, not been considered until now. We derive a random-threshold algorithm which is 0.432-competitive, and show that our threshold distribution is optimal. We also consider the generalization to multiple knapsacks, where an arriving item has a different size in each knapsack and must be placed in at most one. This is equivalent to the Adwords problem where item truncation is not allowed. We derive a randomized algorithm for this problem which is 0.214-competitive.

• 26 publications
• 32 publications
• 7 publications
research
02/11/2020

### An Optimal Algorithm for Online Multiple Knapsack

In the online multiple knapsack problem, an algorithm faces a stream of ...
research
12/01/2020

### Improved Online Algorithms for Knapsack and GAP in the Random Order Model

The knapsack problem is one of the classical problems in combinatorial o...
research
03/01/2022

### Online Unit Profit Knapsack with Untrusted Predictions

A variant of the online knapsack problem is considered in the settings o...
research
12/01/2020

### New Results for the k-Secretary Problem

Suppose that n items arrive online in random order and the goal is to se...
research
06/10/2020

### An Asymptotically Optimal Algorithm for Online Stacking

Consider a storage area where arriving items are stored temporarily in b...
research
07/21/2022

### Optimal Algorithms for Free Order Multiple-Choice Secretary

Suppose we are given integer k ≤ n and n boxes labeled 1,…, n by an adve...
research
05/04/2020

### Advice for Online Knapsack With Removable Items

In the proportional knapsack problem, we are given a knapsack of some ca...

Please sign up or login with your details

Forgot password? Click here to reset