Fair versus unrestricted bin packing

DOI10.1007/S00453-002-0965-6zbMath1001.68181OpenAlexW2024579090MaRDI QIDQ699764

Joan. Boyar, Yossi Azar, Kim S. Larsen, Leah Epstein, Lene Monrad Favrholdt

Publication date: 25 September 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-0965-6

zbMATH Keywords

first-fitdual bin packing problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorial aspects of packing and covering (05B40)

Related Items (8)

Online-bounded analysis ⋮ Online algorithms with advice for the dual bin packing problem ⋮ Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ Tight bounds for online class-constrained packing ⋮ Lower bounds on the performance of online algorithms for relaxed packing problems ⋮ Online Bounded Analysis ⋮ On the sum minimization version of the online bin covering problem ⋮ Online knapsack revisited

This page was built for publication: Fair versus unrestricted bin packing