Does randomization help in on-line bin packing?

DOI10.1016/0020-0190(92)90023-OzbMath0780.68054OpenAlexW2000353412MaRDI QIDQ1198004

Barun Chandra

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90023-o

zbMATH Keywords

competitive analysisanalysis of algorithmslower boundson-line algorithmsrandomized algorithmsbin packing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (5)

On-line bin packing ? A restricted survey ⋮ Scheduling appointments online: the power of deferred decision-making ⋮ Online algorithms with advice for bin packing and scheduling problems ⋮ More on online bin packing with two item sizes ⋮ Batched bin packing

Cites Work

• Unnamed Item
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• A lower bound for on-line bin packing
• Parametric Lower Bound for On-Line Bin-Packing
• New Algorithms for Bin Packing
• On-line bin packing in linear time

This page was built for publication: Does randomization help in on-line bin packing?