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

by   Susanne Albers, et al.

The knapsack problem is one of the classical problems in combinatorial optimization: Given a set of items, each specified by its size and profit, the goal is to find a maximum profit packing into a knapsack of bounded capacity. In the online setting, items are revealed one by one and the decision, if the current item is packed or discarded forever, must be done immediately and irrevocably upon arrival. We study the online variant in the random order model where the input sequence is a uniform random permutation of the item set. We develop a randomized (1/6.65)-competitive algorithm for this problem, outperforming the current best algorithm of competitive ratio 1/8.06 [Kesselheim et al. SIAM J. Comp. 47(5)]. Our algorithm is based on two new insights: We introduce a novel algorithmic approach that employs two given algorithms, optimized for restricted item classes, sequentially on the input sequence. In addition, we study and exploit the relationship of the knapsack problem to the 2-secretary problem. The generalized assignment problem (GAP) includes, besides the knapsack problem, several important problems related to scheduling and matching. We show that in the same online setting, applying the proposed sequential approach yields a (1/6.99)-competitive randomized algorithm for GAP. Again, our proposed algorithm outperforms the current best result of competitive ratio 1/8.06 [Kesselheim et al. SIAM J. Comp. 47(5)].


page 1

page 2

page 3

page 4


A Competitive Analysis of Online Knapsack Problems with Unit Density

We study an online knapsack problem where the items arrive sequentially ...

Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time Design

In the classical prophet inequality, a gambler faces a sequence of items...

Online Multistage Subset Maximization Problems

Numerous combinatorial optimization problems (knapsack, maximum-weight m...

Sample-Based Online Generalized Assignment Problem with Unknown Poisson Arrivals

We study an edge-weighted online stochastic Generalized Assignment Probl...

Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-dependent Competitive Ratios

Motivated by the dynamic assortment offerings and item pricings occurrin...

Size-stochastic Knapsack Online Contention Resolution Schemes

Online contention resolution schemes (OCRSs) are effective rounding tech...

Online Multidimensional Packing Problems in the Random-Order Model

We study online multidimensional variants of the generalized assignment ...

Please sign up or login with your details

Forgot password? Click here to reset