Lower bounds for transversal covers
From MaRDI portal
Publication:1281414
DOI10.1023/A:1008329410829zbMath0924.05009OpenAlexW1480202011MaRDI QIDQ1281414
Eric Mendelsohn, Brett Stevens, Lucia Moura
Publication date: 20 June 1999
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008329410829
Related Items (12)
Packing arrays ⋮ Structures and lower bounds for binary covering arrays ⋮ Constructions of difference covering arrays. ⋮ Constructing strength three covering arrays with augmented annealing ⋮ Upper bounds for covering arrays by tabu search. ⋮ Constructions of new orthogonal arrays and covering arrays of strength three ⋮ Covering and radius-covering arrays: constructions and classification ⋮ Graph-intersecting set systems and LYM inequalities ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Covering arrays on graphs ⋮ Cyclic difference packing and covering arrays. ⋮ On the state of strength-three covering arrays
This page was built for publication: Lower bounds for transversal covers
