Online unbounded knapsack
From MaRDI portal
Cites work
- A faster FPTAS for the unbounded knapsack problem
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- A polynomially solvable special case of the unbounded knapsack problem
- A well-solvable special case of the bounded knapsack problem
- Adventures between lower bounds and higher altitudes. Essays dedicated to Juraj Hromkovič on the occasion of his 60th birthday
- Advice complexity bounds for online delayed \(\mathcal{F} \)-node-, \(H\)-node- and \(H\)-edge-deletion problems
- Advice complexity of adaptive priority algorithms
- Advice complexity of online non-crossing matching
- Advice complexity of priority algorithms
- Approximation and Online Algorithms
- Average-Case Analysis of Off-Line and On-Line Knapsack Problems
- Call admission problems on grids with advice
- Deterministic graph exploration with advice
- Exploring sparse graphs with advice
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1305421 (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?)
- scientific article; zbMATH DE number 7561569 (Why is no real title available?)
- scientific article; zbMATH DE number 7650400 (Why is no real title available?)
- Improved dynamic programming in connection with an FPTAS for the knapsack problem
- Information complexity of online problems
- Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms
- Near-Optimal Bounds for Online Caching with Machine Learned Advice
- On the advice complexity of the knapsack problem
- On the advice complexity of the online dominating set problem
- Online algorithms with advice: the tape model
- Online algorithms with randomly infused advice
- Online algorithms. The state of the art
- Online bin covering with advice
- Online computation with advice
- Online dominating set
- Online graph exploration with advice
- Online knapsack with removal and recourse
- Online Minimum Spanning Tree with Advice
- Online node- and edge-deletion problems with advice
- Online two-dimensional vector packing with advice
- Online two-way trading: randomization and advice
- Online unweighted knapsack problem with removal cost
- Reducibility among combinatorial problems
- Removable online knapsack and advice
- Resource augmentation for online bounded space bin packing
- Rényi-Ulam games and online computation with imperfect advice
- Secretary and online matching problems with machine learned advice
- Semi-online scheduling with decreasing job sizes
- Stochastic on-line knapsack problems
- The advice complexity of a class of hard online problems
- The online knapsack problem: advice and randomization
- Tree exploration with advice
- Unbounded knapsack problems with arithmetic weight sequences
This page was built for publication: Online unbounded knapsack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7000465)
