Improved Space for Bounded-Space, On-Line Bin-Packing

DOI10.1137/0406045zbMath0806.90068OpenAlexW2103737482MaRDI QIDQ4302269

Gerhard J. Woeginger

Publication date: 14 August 1994

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/b72eac38-0e5d-455c-8f8f-76c272a34cf9

zbMATH Keywords

combinatorial problemssuboptimal algorithmsworst case performanceHARMONIC algorithmslinear-time, bounded-space, on-line, bin-packing algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (16)

Assigning service requests in voice-over-internet gateway multiprocessors ⋮ Online bin covering: expectations vs. guarantees ⋮ Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems ⋮ On-line bin packing ? A restricted survey ⋮ The bin covering with delivery problem, extended investigations for the online case ⋮ Drawer algorithms for 1-space bounded multidimensional hyperbox packing ⋮ Efficient 1-space bounded hypercube packing algorithm ⋮ Fully-Dynamic Bin Packing with Little Repacking ⋮ On bin packing with clustering and bin packing with delays ⋮ Repacking helps in bounded space on-line bin-packing ⋮ Resource augmented semi-online bounded space bin packing ⋮ Online bin packing of squares and cubes ⋮ More on batched bin packing ⋮ Bin packing with controllable item sizes ⋮ On lazy bin covering and packing problems ⋮ Online Bin Covering: Expectations vs. Guarantees

This page was built for publication: Improved Space for Bounded-Space, On-Line Bin-Packing