Recommendations
Cites work
- A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem
- A Greedy Heuristic for the Set-Covering Problem
- Classification algorithms for codes and designs
- Classification of orthogonal arrays by integer programming
- Covering arrays and intersecting codes
- Problems and algorithms for covering arrays
- Set Partitioning: A survey
Cited in
(20)- Covering arrays from m-sequences and character sums
- Algebraic techniques for covering arrays and related structures
- Randomized post-optimization of covering arrays
- New covering array numbers
- Problems and algorithms for covering arrays via set covers
- A survey on the problems and algorithms for covering arrays via set covers
- Covering arrays on graphs
- Sequence Covering Arrays and Linear Extensions
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
- scientific article; zbMATH DE number 5177325 (Why is no real title available?)
- Randomized postoptimization of covering arrays
- Covering arrays with mixed alphabet sizes
- Variable strength covering arrays
- Group construction of covering arrays
- A primer on the application of neural networks to covering array generation
- Covering Arrays Avoiding Forbidden Edges
- Optimal ordered covering arrays via an exact algorithm
- Cover starters for covering arrays of strength two
- Constraint models for the covering test problem
- Covering arrays from cyclotomy
This page was built for publication: Covering arrays via set covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1742691)
