research
∙
08/10/2022
Knapsack Secretary Through Boosting
We revisit the knapsack-secretary problem (Babaioff et al.; APPROX 2007)...
share
research
∙
12/01/2020
Best Fit Bin Packing with Random Order Revisited
Best Fit is a well known online algorithm for the bin packing problem, w...
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
∙
12/01/2020
