Knapsack secretary through boosting

DOI10.1007/978-3-031-18367-6_4arXiv2208.05396OpenAlexW4312446998MaRDI QIDQ6176551

Leon Ladewig, Moritz Stinzendörfer, Andreas Abels, Kevin Schewior

Publication date: 25 July 2023

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.05396

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Who solved the secretary problem
• Stochastic on-line knapsack problems
• Best fit bin packing with random order revisited
• Improved online algorithms for Knapsack and GAP in the random order model
• Improved online algorithm for fractional knapsack in the random order model
• The online knapsack problem: advice and randomization
• New results for the \(k\)-secretary problem
• An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
• A Knapsack Secretary Problem with Applications
• Primal Beats Dual on Online Packing LPs in the Random-Order Model
• Matroid Secretary Problems
• Strong Algorithms for the Ordinal Matroid Secretary Problem
• Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution
• Beyond the Worst-Case Analysis of Algorithms
• Secretary Problems via Linear Programming
• A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
• Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order
• Dynamic Programming and Decision Theory

This page was built for publication: Knapsack secretary through boosting