A 4-space bounded approximation algorithm for online bin packing problem

DOI10.1007/978-3-031-22105-7_35MaRDI QIDQ6113869

Kai Wang, Jinghui Xue, Sizhe Li, Mingming Jin, Kun He

Publication date: 10 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

competitive ratioonline algorithmbin packingbounded-spaceworse case analysis

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Repacking helps in bounded space on-line bin-packing
• Linear time-approximation algorithms for bin packing
• Two-Bounded-Space Bin Packing Revisited
• A simple on-line bin-packing algorithm
• Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing
• Optimal Analysis of Best Fit Bin Packing
• The optimal absolute ratio for online bin packing
• A new lower bound for classic online bin packing
• Bounded space on-line bin packing: Best is better than first

This page was built for publication: A 4-space bounded approximation algorithm for online bin packing problem