Better approximation algorithms for bin covering
From MaRDI portal
Recommendations
- Online bin covering: expectations vs. guarantees
- Online Bin Covering: Expectations vs. Guarantees
- Approximation algorithms for generalized and variable-sized bin covering
- Probabilistic analysis of the dual next-fit algorithm for bin covering
- Optimal on-line algorithms for variable-sized bin covering
Cited in
(30)- Hardness of lazy packing and covering
- Hardness of approximation for orthogonal rectangle packing and covering problems
- Bounded-space online bin cover
- An asymptotic fully polynomial time approximation scheme for bin covering.
- Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems
- Approximation and online algorithms for multidimensional bin packing: a survey
- Bin covering with cardinality constraints
- Bin packing problems with rejection penalties and their dual problems
- The maximum resource bin packing problem
- The generalized assignment problem with minimum quantities
- Online bin covering with limited migration
- Two simple algorithms for bin covering
- Probabilistic analysis of the dual next-fit algorithm for bin covering
- Better bin packing approximations via discrepancy theory
- Bin covering with delivery and solving it with evolution of algorithms
- An incentive mechanism for selfish bin covering
- Bin covering with a general profit function: approximability results
- Approximation algorithms for generalized and variable-sized bin covering
- scientific article; zbMATH DE number 1979497 (Why is no real title available?)
- Online Bin Covering with Limited Migration
- Ordinal Maximin Share Approximation for Goods
- Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
- The bin covering with delivery problem, extended investigations for the online case
- Selfish bin covering
- Online bin covering with frequency predictions
- Exact combinatorial algorithms for solving the bin covering problems with strong divisibility and rejection profit
- Packing resizable items with application to video delivery over wireless networks
- Class constrained bin covering
- Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
- On the sum minimization version of the online bin covering problem
This page was built for publication: Better approximation algorithms for bin covering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768348)
