Optimal Resource Augmentations for Online Knapsack
From MaRDI portal
Publication:3603464
DOI10.1007/978-3-540-74208-1_13zbMATH Open1171.90509OpenAlexW1521824362MaRDI QIDQ3603464FDOQ3603464
Authors: Kazuo Iwama, Guochuan Zhang 
Publication date: 17 February 2009
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74208-1_13
Recommendations
- Online knapsack with resource augmentation
- scientific article; zbMATH DE number 7650261
- Online knapsack revisited
- Online knapsack revisited
- The online knapsack problem with incremental capacity
- Resource augmentation for online bounded space bin packing
- scientific article; zbMATH DE number 1670832
- Online bin packing with resource augmentation
- Approximation and Online Algorithms
- scientific article; zbMATH DE number 1839473
Cited In (16)
- Unit cost buyback problem
- Title not available (Why is that?)
- The online knapsack problem with incremental capacity
- 2D knapsack: packing squares
- Randomized algorithms for online knapsack problems
- Online knapsack with resource augmentation
- Online Submodular Maximization Problem with Vector Packing Constraint.
- Online resource management
- Recurring concept memory management in data streams: exploiting data stream concept evolution to improve performance and transparency
- Online knapsack problem under concave functions
- Online removable knapsack problem under convex function
- Online Knapsack Problem Under Concave Functions
- Proportional Cost Buyback Problem with Weight Bounds
- Online unweighted knapsack problem with removal cost
- 2D knapsack: packing squares
- Online removable knapsack with limited cuts
This page was built for publication: Optimal Resource Augmentations for Online Knapsack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603464)
