scientific article; zbMATH DE number 3557207
From MaRDI portal
zbMath0357.68027MaRDI QIDQ4133108
Jeffrey D. Ullman, Michael R. Garey, Ronald L. Graham
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items
On the generalized bin packing problem, A note on a selfish bin packing problem, Approximation and online algorithms for multidimensional bin packing: a survey, Tight bounds for online class-constrained packing, Bin packing under linear constraints, Exact and approximate methods for the score-constrained packing problem, A 4-space bounded approximation algorithm for online bin packing problem, Online bin packing with resource augmentation, Parametric on-line algorithms for packing rectangles and boxes., Improved analysis of two algorithms for min-weighted sum bin packing, On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis, Improved bounds for harmonic-based bin packing algorithms, Best fit bin packing with random order revisited, The optimal absolute ratio for online bin packing, Random-order bin packing, Resource augmented semi-online bounded space bin packing, Approximation algorithms for combinatorial problems, An approximation algorithm for square packing., Scheduling jobs on grid processors, Some simplified NP-complete graph problems, Best Fit Bin Packing with Random Order Revisited, Online bin packing with advice of small size, Approximation scheduling algorithms: a survey, Techniques and results on approximation algorithms for packing circles, Fast algorithms for bin packing, The tight absolute bound of First Fit in the parameterized case
