1 citations · 1 across the 2 of their papers we have counts for
5 papers · 1 filter
Knapsack Secretary Through Boosting
Andreas Abels, Leon Ladewig, Kevin Schewior +1
We revisit the knapsack-secretary problem (Babaioff et al.; APPROX 2007), a generalization of the classic secretary problem in which items have different sizes and multiple items m…
Best Fit Bin Packing with Random Order Revisited
Susanne Albers, Arindam Khan, Leon Ladewig
Best Fit is a well known online algorithm for the bin packing problem, where a collection of one-dimensional items has to be packed into a minimum number of unit-sized bins. In a s…
Improved Online Algorithms for Knapsack and GAP in the Random Order Model
Susanne Albers, Arindam Khan, Leon Ladewig
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 prof…
New Results for the -Secretary Problem
Susanne Albers, Leon Ladewig
Suppose that items arrive online in random order and the goal is to select of them such that the expected sum of the selected items is maximized. The decision for any item…
Online Strip Packing with Polynomial Migration
Klaus Jansen, Kim-Manuel Klein, Maria Kosche +1
We consider the relaxed online strip packing problem: Rectangular items arrive online and have to be packed without rotations into a strip of fixed width such that the packing heig…