scientific article; zbMATH DE number 5177325
From MaRDI portal
Publication:3594048
zbMATH Open1195.05017MaRDI QIDQ3594048FDOQ3594048
Authors: Charles J. Colbourn 
Publication date: 7 August 2007
Title of this publication is not available (Why is that?)
Recommendations
- Covering arrays via set covers
- Problems and algorithms for covering arrays via set covers
- Problems and algorithms for covering arrays
- Covering arrays on graphs
- On \(t\)-covering arrays
- Recursive constructions of covering arrays
- Covering arrays from cyclotomy
- Covering and radius-covering arrays: constructions and classification
- Mixed optimization combinatorial method for constructing covering arrays
- A survey of methods for constructing covering arrays
DesignOrthogonal arrayHeuristic searchTransversalPerfect hash familyCovering arraysGroup-divisible designsInteraction testingQualitative independenceTransversal cover
Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)
Cited In (55)
- A survey of cover-free families: constructions, applications, and generalizations
- Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods
- Ordered covering arrays and upper bounds on covering codes
- Non-uniform covering array with symmetric forbidden edge constraints
- Group divisible covering designs with block size 4: A type of covering array with row limit
- Covering schemes of strength \(t\)
- Optimum detecting arrays for independent interaction faults
- Covering arrays from cyclotomy
- Algorithmic methods for covering arrays of higher index
- Binary consecutive covering arrays
- Binary Covering Arrays and Existentially Closed Graphs
- A construction for strength-3 covering arrays from linear feedback shift register sequences
- Constructing heterogeneous hash families by puncturing linear transversal designs
- The equivalence between optimal detecting arrays and super-simple OAs
- Automation of broad sanity test generation
- The Lovász local lemma and variable strength covering arrays
- A survey of methods for constructing covering arrays
- Asymptotic and constructive methods for covering perfect hash families and covering arrays
- Algebraic modelling of covering arrays
- Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search
- Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
- New covering array numbers
- Linear hash families and forbidden configurations
- Merging covering arrays and compressing multiple sequence alignments
- Algebraic techniques for covering arrays and related structures
- Covering arrays with mixed alphabet sizes
- Improving two recursive constructions for covering arrays
- Mixed covering arrays on graphs of small treewidth
- Graph-intersecting set systems and LYM inequalities
- Software and hardware testing using combinatorial covering suites
- Problems and algorithms for covering arrays
- Partial covering arrays and a generalized Erdős-Ko-Rado property
- Binary covering arrays on tournaments
- Optimum mixed level detecting arrays
- Cyclic consecutive orthogonal arrays
- Constraint models for the covering test problem
- Upper bounds on the size of covering arrays
- Generalized covering designs and clique coverings
- Test sequence construction using minimum information on the tested system
- Finite field constructions of combinatorial arrays
- Upper bounds for covering arrays by tabu search.
- A primer on the application of neural networks to covering array generation
- New optimal covering arrays using an orderly algorithm
- Covering arrays from \(m\)-sequences and character sums
- Covering arrays of strength 3 and 4 from holey difference matrices
- Factorials experiments, covering arrays, and combinatorial testing
- Partial covering arrays: algorithms and asymptotics
- Conditional expectation algorithms for covering arrays
- Disjoint Covers in Replicated Heterogeneous Arrays
- Arrays for combinatorial interaction testing: a review on constructive approaches
- Constructions of covering arrays of strength five
- Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm
- Covering arrays avoiding forbidden edges
- A two-stage algorithm for combinatorial testing
- Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3594048)
