Online knapsack revisited
From MaRDI portal
Publication:260271
DOI10.1007/S00224-014-9566-4zbMATH Open1333.90105DBLPjournals/mst/CyganJS16OpenAlexW1973221673WikidataQ59473381 ScholiaQ59473381MaRDI QIDQ260271FDOQ260271
Authors: Marek Cygan, Łukasz Jeż, Jiří Sgall 
Publication date: 21 March 2016
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-014-9566-4
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the power of randomization in on-line algorithms
- Online knapsack with resource augmentation
- Stochastic on-line knapsack problems
- Online removable knapsack problem under convex function
- On the advice complexity of the knapsack problem
- Prompt mechanism for ad placement over time
- Truthful Mechanisms via Greedy Iterative Packing
- Average-Case Analysis of Off-Line and On-Line Knapsack Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximizing job completions online
- Randomized Algorithms for Removable Online Knapsack Problems
- Fair versus unrestricted bin packing
Cited In (17)
- Title not available (Why is that?)
- Relaxing the irrevocability requirement for online graph algorithms
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version
- Online Knapsack Problems with Limited Cuts
- Online algorithms with advice for the dual bin packing problem
- Online unit profit knapsack with predictions
- Online knapsack problem under concave functions
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
- Online minimization knapsack problem
- Online Knapsack Problem Under Concave Functions
- Lower bounds on the performance of online algorithms for relaxed packing problems
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A Theory of Auto-Scaling for Resource Reservation in Cloud Services
- Title not available (Why is that?)
- Optimal Resource Augmentations for Online Knapsack
- Online budgeted maximum coverage
This page was built for publication: Online knapsack revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q260271)
