Dynamic bin packing with unit fraction items revisited

DOI10.1016/j.ipl.2010.09.002zbMath1379.68353MaRDI QIDQ1675820

Xin Han, Deshi Ye, Chao Peng, Dahai Zhang, Yan Lan

Publication date: 3 November 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.09.002

zbMATH Keywords

competitive ratio; bin packing problem; approximation algorithms

Mathematics Subject Classification ID

90C27: Combinatorial optimization

68W25: Approximation algorithms

Related Items

Analysis of a first-fit algorithm for the capacitated unit covering problem, Dynamic Windows Scheduling with Reallocation, Semi-on-line bin packing: a short overview and a new lower bound, Online bin packing problem with buffer and bounded size revisited, NF-based algorithms for online bin packing with buffer and bounded item size, On-line bin packing with restricted repacking, NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation

Cites Work

• Unnamed Item
• Unnamed Item
• On dynamic bin packing: An improved lower bound and resource augmentation analysis
• Bin packing with divisible item sizes
• An improved lower bound for on-line bin packing algorithms
• Dynamic bin packing of unit fractions items
• On the online bin packing problem
• Windows scheduling as a restricted version of bin packing
• Lower Bound for the Online Bin Packing Problem with Restricted Repacking
• Dynamic Bin Packing
• Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
• Windows Scheduling Problems for Broadcast Systems
• Algorithms and Computation