Problems and algorithms for covering arrays
From MaRDI portal
Publication:1876683
DOI10.1016/j.disc.2003.11.029zbMath1044.05029OpenAlexW2094071977MaRDI QIDQ1876683
Publication date: 20 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.029
Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)
Related Items (47)
Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search ⋮ On a combinatorial framework for fault characterization ⋮ Automation of broad sanity test generation ⋮ Construction of non-isomorphic covering arrays ⋮ Constraint models for the covering test problem ⋮ Mixed covering arrays on graphs of small treewidth ⋮ Roux-type constructions for covering arrays of strengths three and four ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ Partial covering arrays for data hiding and quantization ⋮ Controlled random tests ⋮ Covering arrays on product graphs ⋮ Mixed covering arrays on 3-uniform hypergraphs ⋮ A formal logic approach to constrained combinatorial testing ⋮ Consecutive detecting arrays for interaction faults ⋮ Augmentation of covering arrays of strength two ⋮ Locating and detecting arrays for interaction faults ⋮ Optimal locating arrays for at most two faults ⋮ Improved strength four covering arrays with three symbols ⋮ Algebraic Modelling of Covering Arrays ⋮ New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane ⋮ Hardness results for covering arrays avoiding forbidden edges and error-locating arrays ⋮ On sizes of complete arcs in \(PG(2,q)\) ⋮ Covering arrays via set covers ⋮ Strength two covering arrays: existence tables and projection ⋮ Tabu search for covering arrays using permutation vectors ⋮ An efficient design and implementation of the in-parameter-order algorithm ⋮ Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) ⋮ Application of combinatorial interaction design for DC servomotor PID controller tuning ⋮ Underapproximation for model-checking based on universal circuits ⋮ Constructions of new orthogonal arrays and covering arrays of strength three ⋮ Mixed optimization combinatorial method for constructing covering arrays ⋮ Test sequence construction using minimum information on the tested system ⋮ Mixed covering arrays of strength three with few factors ⋮ Partial covering arrays: algorithms and asymptotics ⋮ A Logic-Based Approach to Combinatorial Testing with Constraints ⋮ Covering arrays of strength 3 and 4 from holey difference matrices ⋮ Linear hash families and forbidden configurations ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ A survey of methods for constructing covering arrays ⋮ Factorials experiments, covering arrays, and combinatorial testing ⋮ Improving two recursive constructions for covering arrays ⋮ Covering arrays avoiding forbidden edges ⋮ Problems and algorithms for covering arrays via set covers ⋮ MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays ⋮ New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane ⋮ Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture ⋮ Tower of covering arrays
Uses Software
Cites Work
- Covering arrays of strength three
- On the state of strength-three covering arrays
- Iterative Exhaustive Pattern Generation for Logic Testing
- Covering arrays with mixed alphabet sizes
- A Generalization of a Theorem due to MacNeish
- Orthogonal Arrays of Index Unity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Problems and algorithms for covering arrays
