Fully dynamic algorithms for bin packing: Being (mostly) myopic helps
Authors:
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 224-235
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Sparsification-a technique for speeding up dynamic graph algorithms1992
- On-line bin packing in linear timeJournal of Algorithms, 1989
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- A 7160 theorem for bin packingJournal of Complexity, 1985
- Dynamic Bin PackingSIAM Journal on Computing, 1983
- An efficient approximation scheme for the one-dimensional bin-packing problem1982
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974
- Fast algorithms for bin packingJournal of Computer and System Sciences, 1974
- Reducibility among Combinatorial Problems1972