Parallel online algorithms for the bin packing problem
From MaRDI portal
Publication:2700390
DOI10.1007/s00453-022-01030-xOpenAlexW4288094245MaRDI QIDQ2700390
Sándor P. Fekete, Arne Schmidt, Jonas Grosse-Holz, Phillip Keldenich
Publication date: 21 April 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-01030-x
Related Items (1)
Cites Work
- Unnamed Item
- Online bin packing with advice
- Online algorithms with advice for bin packing and scheduling problems
- On the list update problem with advice
- A lower bound for on-line bin packing
- An improved lower bound for on-line bin packing algorithms
- Fast algorithms for bin packing
- Online independent sets.
- On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
- Online makespan minimization with parallel schedules
- On the Advice Complexity of One-Dimensional Online Bin Packing
- Online Bin Packing with Advice of Small Size
- A simple on-line bin-packing algorithm
- New Algorithms for Bin Packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Beating the Harmonic Lower Bound for Online Bin Packing
- A new lower bound for classic online bin packing
This page was built for publication: Parallel online algorithms for the bin packing problem