Optimal Resource Augmentations for Online Knapsack
From MaRDI portal
Publication:3603464
DOI10.1007/978-3-540-74208-1_13zbMath1171.90509MaRDI QIDQ3603464
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
Related Items
Online Knapsack Problem Under Concave Functions, Online Submodular Maximization Problem with Vector Packing Constraint., Proportional Cost Buyback Problem with Weight Bounds, The online knapsack problem with incremental capacity, 2D knapsack: packing squares, Online removable knapsack with limited cuts, Randomized algorithms for online knapsack problems, Online unweighted knapsack problem with removal cost, 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 removable knapsack problem under convex function, 2D Knapsack: Packing Squares