Class constrained bin covering

DOI10.1007/S00224-008-9129-7zbMath1209.68659OpenAlexW2034870969MaRDI QIDQ970104

Leah Epstein, Csanád Imreh, Asaf Levin

Publication date: 10 May 2010

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-008-9129-7

zbMATH Keywords

online algorithmsbin covering

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (3)

Online bin covering with limited migration ⋮ Lower bounds and algorithms for the minimum cardinality bin covering problem ⋮ Online Bin Covering with Limited Migration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tight bounds for online class-constrained packing
• Online algorithms for a dual version of bin packing
• Polynomial time approximation schemes for class-constrained packing problems
• An asymptotic fully polynomial time approximation scheme for bin covering.
• Algorithms for on-line bin-packing problems with cardinality constraints
• Bin covering with cardinality constraints
• On a dual version of the one-dimensional bin packing problem
• The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
• Approximation schemes for ordered vector packing problems
• On two class-constrained versions of the multiple knapsack problem

This page was built for publication: Class constrained bin covering