Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- 1 November 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 9 (4), 808-826
- https://doi.org/10.1137/0209062
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Orthogonal Packings in Two DimensionsSIAM Journal on Computing, 1980
- A 2.5 times optimal algorithm for packing in two dimensionsInformation Processing Letters, 1980
- Performance Guarantees for Scheduling AlgorithmsOperations Research, 1978
- Resource constrained scheduling as generalized bin packingJournal of Combinatorial Theory, Series A, 1976
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974