The online knapsack problem: advice and randomization
From MaRDI portal
Recommendations
Cites work
- Advice complexity and barely random algorithms
- Algorithmics for hard problems.
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 2086630 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Information complexity of online problems
- Measuring the problem-relevant information in input
- On the Advice Complexity of Online Problems
- On the advice complexity of the k-server problem
- On the advice complexity of the knapsack problem
- On the advice complexity of the set cover problem
- Online algorithms. The state of the art
- Online algorithms: a survey
- Online computation with advice
- Online knapsack with resource augmentation
- Online removable knapsack with limited cuts
- Online removable square packing
- Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines
- Optimal time-critical scheduling via resource augmentation
- Reducibility among combinatorial problems
- Resource augmentation for online bounded space bin packing
- Semi on-line algorithms for the partition problem
- Semi on-line scheduling on two identical machines
- Semi-online preemptive scheduling: one algorithm for all variants
- Semi-online scheduling with decreasing job sizes
- Speed is as powerful as clairvoyance
- Stochastic on-line knapsack problems
Cited in
(37)- Online algorithms with advice for the dual bin packing problem
- The advice complexity of a class of hard online problems
- The \(k\)-server problem with advice in \(d\) dimensions and on the sphere
- Online node- and edge-deletion problems with advice
- On the advice complexity of the online dominating set problem
- Improved online algorithm for fractional knapsack in the random order model
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Online two-way trading: randomization and advice
- Online bin packing with advice of small size
- Online multi-coloring with advice
- On the advice complexity of the \(k\)-server problem
- Online bin packing with advice
- The secretary problem with reservation costs
- Advice complexity of the online search problem
- On the advice complexity of the knapsack problem
- Optimal online edge coloring of planar graphs with advice
- On the power of randomness versus advice in online computation
- Online graph coloring against a randomized adversary
- Online bin packing with advice of small size
- Online algorithms with advice for bin packing and scheduling problems
- On the advice complexity of the \(k\)-server problem under sparse metrics
- Further results on online node- and edge-deletion problems with advice
- Packing a knapsack of unknown capacity
- Fully Online Matching with Advice on General Bipartite Graphs and Paths
- Knapsack secretary through boosting
- Online knapsack with removal and recourse
- Online unit profit knapsack with predictions
- An optimal algorithm for online multiple knapsack
- Online general knapsack with reservation costs
- Online simple knapsack with bounded predictions
- Removable online knapsack and advice
- A survey of online knapsack problems
- Online knapsack with removal and recourse
- Online unbounded knapsack
- Online simple knapsack with reservation costs
- Online knapsack problems with estimates
- Removable online knapsack: exploiting recourse and bounded item sizes
This page was built for publication: The online knapsack problem: advice and randomization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437775)
