scientific article; zbMATH DE number 1286223
From MaRDI portal
Publication:4242741
DOI<185::AID-JCD3>3.0.CO;2-3 10.1002/(SICI)1520-6610(1999)7:3<185::AID-JCD3>3.0.CO;2-3zbMath0916.05005MaRDI QIDQ4242741
Eric Mendelsohn, Brett Stevens
Publication date: 7 July 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)
Related Items
Problems and algorithms for covering arrays, Packing arrays, An extension of a construction of covering arrays, Structures and lower bounds for binary covering arrays, Constructions of difference covering arrays., Constructing strength three covering arrays with augmented annealing, Constructions of new orthogonal arrays and covering arrays of strength three, Covering arrays of strength 3 and 4 from holey difference matrices, Arrays for combinatorial interaction testing: a review on constructive approaches, Generalized covering designs and clique coverings, Cover starters for covering arrays of strength two, Group Divisible Covering Designs with Block Size 4: A Type of Covering Array with Row Limit, Covering arrays on graphs, Constructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On qualitatively independent partitions and related problems
- On the maximum number of qualitative independent partitions
- Qualitative independence and Sperner problems for directed graphs
- Capacities: From information theory to extremal set theory
- The construction of antipodal triple systems by simulated annealing
- Sperner capacities
- Two applications (for search theory and truth functions) of Sperner type theorems
- Families of \(k\)-independent sets
- Covering arrays and intersecting codes
- Compressing inconsistent data
