Online removable knapsack with limited cuts
From MaRDI portal
Publication:410717
DOI10.1016/j.tcs.2010.08.009zbMath1234.68469MaRDI QIDQ410717
Publication date: 3 April 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.08.009
Related Items
Online Knapsack Problem Under Concave Functions, Packing a Knapsack of Unknown Capacity, 2D knapsack: packing squares, Online unweighted knapsack problem with removal cost, Online minimization knapsack problem, Online knapsack problem under concave functions, The online knapsack problem: advice and randomization
Uses Software
Cites Work
- Stochastic on-line knapsack problems
- Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
- Online Minimization Knapsack Problem
- Optimal Resource Augmentations for Online Knapsack
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Finite-State Online Algorithms and Their Automated Competitive Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item