On-line and off-line approximation algorithms for vector covering problems
From MaRDI portal
Recommendations
Cited in
(13)- Online variable sized covering
- scientific article; zbMATH DE number 7559382 (Why is no real title available?)
- Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
- Mean analysis of an online algorithm for the vertex cover problem
- There is no asymptotic PTAS for two-dimensional vector packing
- On-line and off-line approximation algorithms for vector covering problems
- Approximation and online algorithms for multidimensional bin packing: a survey
- Bin covering with cardinality constraints
- On the sum minimization version of the online bin covering problem
- The skiving stock problem and its relation to hypergraph matchings
- There is no APTAS for 2-dimensional vector bin packing: revisited
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
- Lower bounds for online bin covering-type problems
This page was built for publication: On-line and off-line approximation algorithms for vector covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386465)
