Class constrained bin covering

DOI10.1007/S00224-008-9129-7zbMATH Open1209.68659OpenAlexW2034870969MaRDI QIDQ970104FDOQ970104

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

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

Cites Work

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

Cited In (4)

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

This page was built for publication: Class constrained bin covering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970104)