Randomized algorithms for online knapsack problems
From MaRDI portal
Publication:476887
DOI10.1016/J.TCS.2014.10.017zbMATH Open1303.68160OpenAlexW1980280644MaRDI QIDQ476887FDOQ476887
Kazuhisa Makino, Yasushi Kawase, Xin Han
Publication date: 2 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.017
Recommendations
Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Stochastic on-line knapsack problems
- Average-Case Analysis of Off-Line and On-Line Knapsack Problems
- Title not available (Why is that?)
- Randomized Algorithms for Removable Online Knapsack Problems
- Constant-Time Approximation Algorithms for the Knapsack Problem
- A Knapsack Secretary Problem with Applications
- Optimal Resource Augmentations for Online Knapsack
- Adaptivity and approximation for stochastic packing problems
- Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
- Online Minimization Knapsack Problem
- Online Knapsack Problem with Removal Cost
- Online Knapsack Revisited
- Algorithms – ESA 2005
Cited In (22)
- Unit cost buyback problem
- Title not available (Why is that?)
- Relaxing the irrevocability requirement for online graph algorithms
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- The online knapsack problem with incremental capacity
- Online Knapsack Problems with Limited Cuts
- Online Submodular Maximization Problem with Vector Packing Constraint.
- Learning-augmented algorithms for online subset sum
- Improved online algorithms for Knapsack and GAP in the random order model
- Online knapsack problem under concave functions
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
- Randomized Online Algorithms with High Probability Guarantees
- Online minimization knapsack problem
- Online Knapsack Problem Under Concave Functions
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Online generalized assignment problem with historical information
- Randomized approximation and online algorithms for assignment problems
- Packing a Knapsack of Unknown Capacity
- Improved online algorithm for fractional knapsack in the random order model
- Online budgeted maximum coverage
- Finite-State Online Algorithms and Their Automated Competitive Analysis
- Proportional cost buyback problem with weight bounds
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)
