Pages that link to "Item:Q2333828"
From MaRDI portal
The following pages link to Problems and algorithms for covering arrays via set covers (Q2333828):
Displaying 13 items.
- Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740) (← links)
- Covering arrays via set covers (Q1742691) (← links)
- An algorithm for set covering problem (Q1823139) (← links)
- Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm (Q2193001) (← links)
- A greedy algorithm to construct covering arrays using a graph representation (Q2201668) (← links)
- A survey on the problems and algorithms for covering arrays via set covers (Q2333829) (← links)
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps (Q3009761) (← links)
- (Q3594048) (← links)
- (Q3831014) (← links)
- Two methods of ordering the covering elements for the solution of the set covering problem (Q4007333) (← links)
- A primer on the application of neural networks to covering array generation (Q5043857) (← links)
- Disjoint Covers in Replicated Heterogeneous Arrays (Q5202961) (← links)
- Connected Set Cover Problem and Its Applications (Q5434403) (← links)