Dynamic bin packing of unit fractions items

DOI10.1016/j.tcs.2008.09.028zbMath1155.68086OpenAlexW1734979789MaRDI QIDQ2378533

Joseph Wun-Tat Chan, Prudence W. H. Wong, Tak-Wah Lam

Publication date: 8 January 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.09.028

zbMATH Keywords

competitive analysisonline algorithmsbin packing

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items

Semi-on-line bin packing: a short overview and a new lower bound ⋮ Dynamic bin packing with unit fraction items revisited ⋮ Dynamic multi-dimensional bin packing ⋮ Dynamic Windows Scheduling with Reallocation ⋮ On-line bin packing with restricted repacking ⋮ Fully dynamic bin packing revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bin packing with divisible item sizes
• An improved lower bound for on-line bin packing algorithms
• On the online bin packing problem
• Windows scheduling as a restricted version of bin packing
• On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
• Dynamic Bin Packing
• Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
• Windows Scheduling Problems for Broadcast Systems
• Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings
• Algorithms and Computation