On-line bin packing in linear time
From MaRDI portal
Publication:4732116
DOI10.1016/0196-6774(89)90031-XzbMath0682.68057OpenAlexW2016393589MaRDI QIDQ4732116
No author found.
Publication date: 1989
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(89)90031-x
Related Items
Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time ⋮ Assigning service requests in voice-over-internet gateway multiprocessors ⋮ Online bin covering: expectations vs. guarantees ⋮ Semi-on-line bin packing: a short overview and a new lower bound ⋮ Approximate strip packing: revisited ⋮ Bounds for online bin packing with cardinality constraints ⋮ The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints ⋮ Bin packing with rejection revisited ⋮ Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing ⋮ Online variable-sized bin packing ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Average-case analysis of the smart next fit algorithm ⋮ Open-end bin packing: new and old analysis approaches ⋮ A note on a variant of the online open end bin packing problem ⋮ Multidimensional on-line bin packing: Algorithms and worst-case analysis ⋮ On-line bin packing ? A restricted survey ⋮ Online bin packing with cardinality constraints resolved ⋮ An asymptotic competitive scheme for online bin packing ⋮ A note on online hypercube packing ⋮ Drawer algorithms for 1-space bounded multidimensional hyperbox packing ⋮ Online bin packing with resource augmentation ⋮ Unnamed Item ⋮ Efficient 1-space bounded hypercube packing algorithm ⋮ On-line bin packing with restricted repacking ⋮ Competitive clustering of stochastic communication patterns on a ring ⋮ A 5/4 linear time bin packing algorithm ⋮ Improved bounds for harmonic-based bin packing algorithms ⋮ Fully-Dynamic Bin Packing with Little Repacking ⋮ Best fit bin packing with random order revisited ⋮ Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing ⋮ A fundamental restriction on fully dynamic maintenance of bin packing ⋮ Online bin packing of squares and cubes ⋮ The optimal absolute ratio for online bin packing ⋮ Online bin packing problem with buffer and bounded size revisited ⋮ More on online bin packing with two item sizes ⋮ Does randomization help in on-line bin packing? ⋮ An improved lower bound for on-line bin packing algorithms ⋮ An on-line algorithm for multidimensional bin packing ⋮ Resource augmented semi-online bounded space bin packing ⋮ Packings in two dimensions: Asymptotic average-case analysis of algorithms ⋮ Online bin packing of squares and cubes ⋮ A new upper bound for the online square packing problem in a strip ⋮ Two-dimensional online bin packing with rotation ⋮ Class constrained bin packing revisited ⋮ ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING ⋮ Bin packing with controllable item sizes ⋮ A new lower bound for classic online bin packing ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Unnamed Item ⋮ Best Fit Bin Packing with Random Order Revisited ⋮ More on ordered open end bin packing ⋮ Average-case analysis of the modified harmonic algorithm ⋮ Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps ⋮ Online square and cube packing ⋮ Linear time-approximation algorithms for bin packing ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation ⋮ Online Bin Covering: Expectations vs. Guarantees ⋮ Improved lower bounds for the online bin packing problem with cardinality constraints ⋮ NF-based algorithms for online bin packing with buffer and bounded item size
This page was built for publication: On-line bin packing in linear time
