Online bin packing with advice of small size
DOI10.1007/S00224-018-9862-5zbMATH Open1435.68384OpenAlexW2797367353WikidataQ129986891 ScholiaQ129986891MaRDI QIDQ2322702FDOQ2322702
Authors: Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault, Adi Rosén 
Publication date: 5 September 2019
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-018-9862-5
Recommendations
Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Repacking helps in bounded space on-line bin-packing
- The online knapsack problem: advice and randomization
- Online bin packing with advice
- Algorithms for the relaxed online bin-packing model
- On the advice complexity of the \(k\)-server problem
- On Bin Packing with Conflicts
- 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
- Advice complexity and barely random algorithms
- Measuring the problem-relevant information in input
- Online computation with advice
- Analysis and design of algorithms in combinatorial optimization. (School held in Udine in September 1979)
- How Much Information about the Future Is Needed?
- On online algorithms with advice for the \(k\)-server problem
- Reordering buffer management with advice
- Online bin packing with advice of small size
- On the advice complexity of the \(k\)-server problem under sparse metrics
- The string guessing problem as a method to prove lower bounds on the advice complexity
- Randomization can be as helpful as a glimpse of the future in online computation
- Title not available (Why is that?)
- Weighted Online Problems with Advice
- Beating the harmonic lower bound for online bin packing
- Online minimum spanning tree with advice (extended abstract)
Cited In (14)
- Online bin packing with advice
- Online computation with untrusted advice
- Online algorithms with advice for bin packing and scheduling problems
- Online bin packing with advice of small size
- Parallel solutions for ordinal scheduling with a small number of machines
- A simple PTAS for the dual bin packing problem and advice complexity of its online version
- Online unit profit knapsack with predictions
- Approximation and Online Algorithms
- Online bin covering with advice
- Online bin covering with advice
- On the advice complexity of one-dimensional online bin packing
- Online bin packing with advice
- Online bin packing with resource augmentation
- Online two-dimensional vector packing with advice
Uses Software
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 Q2322702)
