Online bin packing with advice of small size
From MaRDI portal
Publication:3449804
DOI10.1007/978-3-319-21840-3_4zbMATH Open1435.68385OpenAlexW2223743052MaRDI QIDQ3449804FDOQ3449804
Authors: Spyros Angelopoulos, Shahin Kamali, Marc P. Renault, Adi Rosén, Christoph Dürr 
Publication date: 30 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21840-3_4
Recommendations
Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Repacking helps in bounded space on-line bin-packing
- The online knapsack problem: advice and randomization
- Algorithms for the relaxed online bin-packing model
- On the advice complexity of the \(k\)-server problem
- On Bin Packing with Conflicts
- On the online bin packing problem
- On the Advice Complexity of Online Problems
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- New lower bounds for certain classes of bin packing algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Online algorithms with advice for bin packing and scheduling problems
- On the list update problem with advice
- Advice complexity and barely random algorithms
- Measuring the problem-relevant information in input
- Online computation with advice
- On online algorithms with advice for the \(k\)-server problem
- Title not available (Why is that?)
- Reordering Buffer Management with Advice
- The string guessing problem as a method to prove lower bounds on the advice complexity
Cited In (7)
- Online bin packing with advice of small size
- Online algorithms with advice for bin packing and scheduling problems
- On the list update problem with advice
- Online algorithms with advice for the dual bin packing problem
- Lower bounds for several online variants of bin packing
- On the advice complexity of the knapsack problem
- Parallel online algorithms for the bin packing problem
This page was built for publication: Online bin packing with advice of small size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449804)
