Online Bin Packing with Cardinality Constraints

DOI10.1137/050639065zbMath1130.68063OpenAlexW2091720918MaRDI QIDQ5426887

Leah Epstein

Publication date: 16 November 2007

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

Full work available at URL: https://doi.org/10.1137/050639065

zbMATH Keywords

cardinality constraintsbin packingOnline algorithmsunbounded space online algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Related Items (21)

Models for video-on-demand scheduling with costs ⋮ Bounds for online bin packing with cardinality constraints ⋮ The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints ⋮ Selfish bin packing with cardinality constraints ⋮ Online bin packing with cardinality constraints resolved ⋮ Approximation schemes for packing splittable items with cardinality constraints ⋮ Bin packing with general cost structures ⋮ Improved results for a memory allocation problem ⋮ Colored bin packing: online algorithms and lower bounds ⋮ Bin covering with cardinality constraints ⋮ Online unit clustering: Variations on a theme ⋮ Online interval coloring with packing constraints ⋮ Class constrained bin packing revisited ⋮ Constructive heuristics for the canister filling problem ⋮ Lower bounds for several online variants of bin packing ⋮ Approximation Schemes for Packing Splittable Items with Cardinality Constraints ⋮ More on batched bin packing ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Unnamed Item ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Improved lower bounds for the online bin packing problem with cardinality constraints

This page was built for publication: Online Bin Packing with Cardinality Constraints