Algorithms for the Relaxed Online Bin-Packing Model
From MaRDI portal
Publication:2706124
DOI10.1137/S0097539799180408zbMath0976.68080OpenAlexW2072676072MaRDI QIDQ2706124
Giorgio Gambosi, Maurizio Talamo, Alberto Postiglione
Publication date: 19 March 2001
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539799180408
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorial optimization (90C27)
Related Items (14)
Online Bin Packing with Advice of Small Size ⋮ Semi-on-line bin packing: a short overview and a new lower bound ⋮ Unnamed Item ⋮ On-line bin packing with restricted repacking ⋮ Fully-Dynamic Bin Packing with Little Repacking ⋮ Resource augmented semi-online bounded space bin packing ⋮ Fully dynamic bin packing revisited ⋮ A robust APTAS for the classical bin packing problem ⋮ Improved lower bounds for semi-online bin packing problems ⋮ Online bin packing with advice of small size ⋮ A Robust AFPTAS for Online Bin Packing with Polynomial Migration ⋮ NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation ⋮ NF-based algorithms for online bin packing with buffer and bounded item size ⋮ Online bin packing with advice
This page was built for publication: Algorithms for the Relaxed Online Bin-Packing Model
