Improved covering arrays using covering perfect hash families with groups of restricted entries
From MaRDI portal
Publication:2287570
DOI10.1016/j.amc.2019.124826zbMath1433.05069WikidataQ126866717 ScholiaQ126866717MaRDI QIDQ2287570
Idelfonso Izquierdo-Marquez, Jose Torres-Jimenez
Publication date: 21 January 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2019.124826
05B15: Orthogonal arrays, Latin squares, Room squares
05B40: Combinatorial aspects of packing and covering
Related Items
An extension of a construction of covering arrays, In-parameter-order strategies for covering perfect hash families
Cites Work
- A two-stage algorithm for combinatorial testing
- A survey of methods for constructing covering arrays
- Constructing strength three covering arrays with augmented annealing
- Tabu search for covering arrays using permutation vectors
- Asymptotic and constructive methods for covering perfect hash families and covering arrays
- Covering arrays of strength three from extended permutation vectors
- A greedy-metaheuristic 3-stage approach to construct covering arrays
- Covering arrays on product graphs
- A survey of combinatorial testing
- Subspace restrictions and affine composition for covering perfect hash families
- Covering arrays of higher strength from permutation vectors