Randomized algorithms for online knapsack problems
From MaRDI portal
Publication:476887
DOI10.1016/J.TCS.2014.10.017zbMATH Open1303.68160OpenAlexW1980280644MaRDI QIDQ476887FDOQ476887
Recommendations
Cites work
- scientific article; zbMATH DE number 2086630 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A Knapsack Secretary Problem with Applications
- Adaptivity and approximation for stochastic packing problems
- Algorithms – ESA 2005
- Approximating the stochastic Knapsack problem: the benefit of adaptivity
- Average-Case Analysis of Off-Line and On-Line Knapsack Problems
- Constant-time approximation algorithms for the knapsack problem
- Online knapsack problem with removal cost
- Online knapsack revisited
- Online minimization knapsack problem
- Optimal Resource Augmentations for Online Knapsack
- Randomized algorithms for removable online knapsack problems
- Stochastic on-line knapsack problems
Cited in
(26)- Packing a knapsack of unknown capacity
- Online minimization knapsack problem
- Finite-State Online Algorithms and Their Automated Competitive Analysis
- Online Knapsack Problem Under Concave Functions
- Proportional cost buyback problem with weight bounds
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Improved online algorithm for fractional knapsack in the random order model
- The online knapsack problem with incremental capacity
- The online knapsack problem: advice and randomization
- Online Knapsack Problems with Limited Cuts
- Unit cost buyback problem
- Online knapsack revisited
- Randomized algorithms for removable online knapsack problems
- scientific article; zbMATH DE number 2086630 (Why is no real title available?)
- Online budgeted maximum coverage
- Online knapsack problem under concave functions
- Online generalized assignment problem with historical information
- Online Submodular Maximization Problem with Vector Packing Constraint.
- Online minimization knapsack problem
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
- Improved online algorithms for knapsack and GAP in the random order model
- Randomized Online Algorithms with High Probability Guarantees
- Online knapsack revisited
- Randomized approximation and online algorithms for assignment problems
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- Learning-augmented algorithms for online subset sum
This page was built for publication: Randomized algorithms for online knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476887)
