Online Bin Packing with Advice of Small Size
From MaRDI portal
Publication:3449804
DOI10.1007/978-3-319-21840-3_4zbMath1435.68385OpenAlexW2223743052MaRDI QIDQ3449804
Adi Rosén, Spyros Angelopoulos, Marc P. Renault, Shahin Kamali, 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
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)
Related Items (6)
Online algorithms with advice for the dual bin packing problem ⋮ Parallel online algorithms for the bin packing problem ⋮ Online algorithms with advice for bin packing and scheduling problems ⋮ On the list update problem with advice ⋮ Lower bounds for several online variants of bin packing ⋮ Online bin packing with advice of small size
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New lower bounds for certain classes of bin packing algorithms
- Online algorithms with advice for bin packing and scheduling problems
- On the list update problem with advice
- Online computation with advice
- The string guessing problem as a method to prove lower bounds on the advice complexity
- Repacking helps in bounded space on-line bin-packing
- On online algorithms with advice for the \(k\)-server problem
- The online knapsack problem: advice and randomization
- Algorithms for the Relaxed Online Bin-Packing Model
- On the Advice Complexity of the k-Server Problem
- Reordering Buffer Management with Advice
- 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
- Advice Complexity and Barely Random Algorithms
- Measuring the problem-relevant information in input
This page was built for publication: Online Bin Packing with Advice of Small Size
