Fully Dynamic Bin Packing
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 407-434
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A Robust APTAS for the Classical Bin Packing ProblemLecture Notes in Computer Science, 2006
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic HelpsSIAM Journal on Computing, 1998
- Partially dynamic bin packing can be solved within 1 + ε in (amortized) polylogarithmic timeInformation Processing Letters, 1997
- A fundamental restriction on fully dynamic maintenance of bin packingInformation Processing Letters, 1996
- Analysis of a Compound Bin Packing AlgorithmSIAM Journal on Discrete Mathematics, 1991
- Parallel approximation algorithms for bin packingInformation and Computation, 1989
- A 7160 theorem for bin packingJournal of Complexity, 1985
- Dynamic Bin PackingSIAM Journal on Computing, 1983
- Bin packing can be solved within 1 + ε in linear timeCombinatorica, 1981
- Fast algorithms for bin packingJournal of Computer and System Sciences, 1974