Parallel online algorithms for the Bin Packing Problem

DOI10.1007/978-3-030-39479-0_8MaRDI QIDQ2193086zbMATH OpenOpenAlexFDO

Authors Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, Arne Schmidt

Publication date 24 August 2020

Full work available at URL https://arxiv.org/abs/1910.03249

zbMATH Keywords

bin packingcompetitive analysisonline algorithms

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Recommendations

• Online bin packing with advice
• Online bin packing with advice
• Online bin packing with advice of small size
• Online bin packing with advice of small size
• Online algorithms with advice for bin packing and scheduling problems

Cited in

(4)

• Online algorithms for a dual version of bin packing
• Online algorithms with advice for the dual bin packing problem
• Comparing online algorithms for bin packing problems
• Parallel solutions for preemptive makespan scheduling on two identical machines

This page was built for publication: Parallel online algorithms for the Bin Packing Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2193086)