A simple on-line bin-packing algorithm
From MaRDI portal
Publication:3766848
DOI10.1145/3828.3833zbMath0629.68045OpenAlexW2048628062MaRDI QIDQ3766848
No author found.
Publication date: 1985
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3828.3833
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items (only showing first 100 items - show all)
Analytical Problem Solving Based on Causal, Correlational and Deductive Models ⋮ A 4-space bounded approximation algorithm for online bin packing problem ⋮ Scheduling appointments online: the power of deferred decision-making ⋮ Unnamed Item ⋮ Interior-Point-Based Online Stochastic Bin Packing ⋮ Online bin packing of squares and cubes ⋮ Online bin packing of squares and cubes ⋮ A new lower bound for classic online bin packing ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Unnamed Item ⋮ Streaming algorithms for bin packing and vector scheduling ⋮ Best Fit Bin Packing with Random Order Revisited ⋮ Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ A tight lower bound for the online bounded space hypercube bin packing problem ⋮ Deep performance analysis of refined harmonic bin packing algorithm ⋮ A probabilistic analysis of the next fit decreasing bin packing heuristic ⋮ Models for video-on-demand scheduling with costs ⋮ Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time ⋮ Shelf algorithms for on-line strip packing ⋮ Assigning service requests in voice-over-internet gateway multiprocessors ⋮ Algorithms for on-line bin-packing problems with cardinality constraints ⋮ 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 ⋮ Online Colored Bin Packing ⋮ Bin packing with rejection revisited ⋮ Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing ⋮ Black and White Bin Packing Revisited ⋮ Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing ⋮ Online variable-sized bin packing ⋮ Batched bin packing revisited ⋮ 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 ⋮ A tight lower bound for optimal bin packing ⋮ On-line bin packing ? A restricted survey ⋮ Dynamic multi-dimensional bin packing ⋮ Online bin packing with cardinality constraints resolved ⋮ Bin packing problem with scenarios ⋮ An asymptotic competitive scheme for online bin packing ⋮ A note on online hypercube packing ⋮ Pareto optimal equilibria for selfish bin packing with uniform cost sharing ⋮ Drawer algorithms for 1-space bounded multidimensional hyperbox packing ⋮ Online bin packing with resource augmentation ⋮ Bin packing with general cost structures ⋮ Colored bin packing: online algorithms and lower bounds ⋮ Comparing online algorithms for bin packing problems ⋮ Efficient 1-space bounded hypercube packing algorithm ⋮ On-line bin packing with restricted repacking ⋮ Parallel online algorithms for the bin packing problem ⋮ Bin covering with cardinality constraints ⋮ Quality of equilibria for selfish bin packing with cost sharing variants ⋮ Selfish Bin Packing ⋮ Two-dimensional packing with conflicts ⋮ On the effectiveness of the harmonic shelf algorithm for on-line strip packing ⋮ Improved bounds for harmonic-based bin packing algorithms ⋮ Fully-Dynamic Bin Packing with Little Repacking ⋮ Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants ⋮ On bin packing with clustering and bin packing with delays ⋮ 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 ⋮ The optimal absolute ratio for online bin packing ⋮ Bounds for online bounded space hypercube packing ⋮ Online bin packing problem with buffer and bounded size revisited ⋮ Average case analysis of bounded space bin packing algorithms ⋮ Lower bound for 3-batched bin packing ⋮ More on online bin packing with two item sizes ⋮ An improved lower bound for on-line bin packing algorithms ⋮ An on-line algorithm for multidimensional bin packing ⋮ Selfish bin packing ⋮ The class constrained bin packing problem with applications to video-on-demand ⋮ Repacking helps in bounded space on-line bin-packing ⋮ A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case ⋮ Resource augmented semi-online bounded space bin packing ⋮ Scheduling jobs on grid processors ⋮ Tight results for next fit and worst fit with resource augmentation ⋮ A new upper bound for the online square packing problem in a strip ⋮ Two-dimensional online bin packing with rotation ⋮ Batched bin packing ⋮ Class constrained bin packing revisited ⋮ An on-line algorithm for variable-sized bin packing ⋮ Average-case analysis of cutting and packing in two dimensions ⋮ More on batched bin packing ⋮ Fully dynamic bin packing revisited ⋮ ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING ⋮ Bin packing with controllable item sizes ⋮ On-line grid-packing with a single active grid ⋮ Packing resizable items with application to video delivery over wireless networks ⋮ Online algorithms for 1-space bounded 2-dimensional bin packing and square packing ⋮ A robust APTAS for the classical bin packing problem ⋮ Bidimensional packing by bilinear programming ⋮ Quality of strong equilibria for selfish bin packing with uniform cost sharing ⋮ Variable sized online interval coloring with bandwidth ⋮ More on ordered open end bin packing ⋮ Average-case analysis of the modified harmonic algorithm
This page was built for publication: A simple on-line bin-packing algorithm
