Pages that link to "Item:Q1386465"
From MaRDI portal
The following pages link to On-line and off-line approximation algorithms for vector covering problems (Q1386465):
Displaying 12 items.
- There is no asymptotic PTAS for two-dimensional vector packing (Q293152) (← links)
- On the sum minimization version of the online bin covering problem (Q987687) (← links)
- Mean analysis of an online algorithm for the vertex cover problem (Q987781) (← links)
- The skiving stock problem and its relation to hypergraph matchings (Q1662646) (← links)
- Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case (Q1730578) (← links)
- Online variable sized covering (Q1854485) (← links)
- Lower bounds for online bin covering-type problems (Q2304119) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Bin covering with cardinality constraints (Q2446840) (← links)
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory (Q4646531) (← links)
- (Q5089171) (← links)
- There is no APTAS for 2-dimensional vector bin packing: revisited (Q6072215) (← links)