Recommendations
- scientific article; zbMATH DE number 1798171
- On-line machine covering
- On-line machine covering
- The online set cover problem
- The online set cover problem
- Variable-Size Rectangle Covering
- On-line vertex-covering
- Optimal on-line algorithms for variable-sized bin covering
- Online maximum \(k\)-coverage
- Online maximum \(k\)-coverage
Cites work
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- On a dual version of the one-dimensional bin packing problem
- On-line and off-line approximation algorithms for vector covering problems
- Online algorithms for a dual version of bin packing
- Online algorithms. The state of the art
- Optimal on-line algorithms for variable-sized bin covering
- Probabilistic analysis of algorithms for dual bin packing problems
Cited in
(9)- Tighter bounds for the harmonic bin packing algorithm
- scientific article; zbMATH DE number 2016848 (Why is no real title available?)
- Online Bin Covering with Limited Migration
- On-line and off-line approximation algorithms for vector covering problems
- scientific article; zbMATH DE number 1798171 (Why is no real title available?)
- Lower bounds for online bin covering-type problems
- Online bin covering with limited migration
- scientific article; zbMATH DE number 6696496 (Why is no real title available?)
- Approximation algorithms for generalized and variable-sized bin covering
This page was built for publication: Online variable sized covering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854485)
