Two simple algorithms for bin covering

MaRDI QIDQ2707233zbMATH OpenFDO

Authors Martine Labbé, János Csirik, Shuzhong Zhang, Johannes Bartholomeus Gerardus Frenk

Publication date 1 April 2001

Published in Acta Cybernetica (Search for Journal in Brave)

zbMATH Keywords

bin covering

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Algorithms in computer science (68W99)

Recommendations

• scientific article; zbMATH DE number 1779967
• Better approximation algorithms for bin covering
• A min-cost bin covering problem and its algorithm
• Approximation algorithms for generalized and variable-sized bin covering
• Bin covering with cardinality constraints
• Lower bounds and algorithms for the minimum cardinality bin covering problem
• Two-Dimensional Finite Bin-Packing Algorithms
• Cover Algorithms and Their Combination
• scientific article; zbMATH DE number 1979497
• A polynomial time algorithm for the 2-poset cover problem

Cited in

(12)

• An asymptotic fully polynomial time approximation scheme for bin covering.
• Lower bounds and algorithms for the minimum cardinality bin covering problem
• Approximation and online algorithms for multidimensional bin packing: a survey
• Comparing online algorithms for bin packing problems
• The maximum resource bin packing problem
• An incentive mechanism for selfish bin covering
• Ordinal Maximin Share Approximation for Goods
• Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
• An on-line bin-batching problem.
• Selfish bin covering
• Online bin covering with frequency predictions
• Exact combinatorial algorithms for solving the bin covering problems with strong divisibility and rejection profit

This page was built for publication: Two simple algorithms for bin covering

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