A fundamental restriction on fully dynamic maintenance of bin packing

DOI10.1016/0020-0190(96)00112-3zbMath0875.68024OpenAlexW2032955874MaRDI QIDQ671611

Errol L. Lloyd, Zoran Ivković

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00112-3

zbMATH Keywords

AlgorithmsBin packing

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Approximation algorithms (68W25)

Related Items (6)

Semi-on-line bin packing: a short overview and a new lower bound ⋮ On-line bin packing with restricted repacking ⋮ Fully-Dynamic Bin Packing with Little Repacking ⋮ Resource augmented semi-online bounded space bin packing ⋮ Improved lower bounds for semi-online bin packing problems ⋮ Online bin packing with advice

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel approximation algorithms for bin packing
• A lower bound for on-line bin packing
• Bin packing can be solved within 1+epsilon in linear time
• Dynamic Bin Packing
• A simple on-line bin-packing algorithm
• New Algorithms for Bin Packing
• Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
• On-line bin packing in linear time

This page was built for publication: A fundamental restriction on fully dynamic maintenance of bin packing