Optimal Resource Augmentations for Online Knapsack

DOI10.1007/978-3-540-74208-1_13zbMath1171.90509OpenAlexW1521824362MaRDI QIDQ3603464

Kazuo Iwama, Guo-Chuan 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

zbMATH Keywords

on-line algorithmsknapsackresource augmentation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Related Items (13)

The online knapsack problem with incremental capacity ⋮ 2D knapsack: packing squares ⋮ Online removable knapsack with limited cuts ⋮ Online removable knapsack problem under convex function ⋮ Randomized algorithms for online knapsack problems ⋮ Online Knapsack Problem Under Concave Functions ⋮ Online unweighted knapsack problem with removal cost ⋮ 2D Knapsack: Packing Squares ⋮ Proportional Cost Buyback Problem with Weight Bounds ⋮ Recurring concept memory management in data streams: exploiting data stream concept evolution to improve performance and transparency ⋮ Online knapsack problem under concave functions ⋮ Unit cost buyback problem ⋮ Online Submodular Maximization Problem with Vector Packing Constraint.

This page was built for publication: Optimal Resource Augmentations for Online Knapsack