25 citations · 53 across the 11 of their papers we have counts for
5 papers · 1 filter
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…
Explorable Uncertainty in Scheduling with Non-Uniform Testing Times
Susanne Albers, Alexander Eckl
The problem of scheduling with testing in the framework of explorable uncertainty models environments where some preliminary action can influence the duration of a task. In the mod…
Scheduling in the Random-Order Model
Susanne Albers, Maximilian Janke
Makespan minimization on identical machines is a fundamental problem in online scheduling. The goal is to assign a sequence of jobs to identical parallel machines so as to mini…