Pages that link to "Item:Q2333829"
From MaRDI portal
The following pages link to A survey on the problems and algorithms for covering arrays via set covers (Q2333829):
Displaying 13 items.
- A survey of binary covering arrays (Q540079) (← links)
- Hardness results for covering arrays avoiding forbidden edges and error-locating arrays (Q650881) (← links)
- A note on `Algorithms for connected set cover problem and fault-tolerant connected set cover problem' (Q653341) (← links)
- Covering arrays via set covers (Q1742691) (← links)
- Problems and algorithms for covering arrays (Q1876683) (← links)
- In-parameter-order strategies for covering perfect hash families (Q2079142) (← links)
- Heuristically enhanced IPO algorithms for covering array generation (Q2115896) (← links)
- Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm (Q2193001) (← links)
- Problems and algorithms for covering arrays via set covers (Q2333828) (← links)
- Two methods of ordering the covering elements for the solution of the set covering problem (Q4007333) (← links)
- IPO-Q: A Quantum-Inspired Approach to the IPO Strategy Used in CA Generation (Q5014686) (← links)
- A primer on the application of neural networks to covering array generation (Q5043857) (← links)
- Disjoint Covers in Replicated Heterogeneous Arrays (Q5202961) (← links)