Randomized post-optimization of covering arrays

DOI10.1016/j.ejc.2012.07.017zbMath1252.05023OpenAlexW2052799565MaRDI QIDQ1761502

Charles J. Colbourn, Goran Konjevod, Peyman Nayeri

Publication date: 15 November 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.07.017

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items

On a combinatorial framework for fault characterization, Covering arrays, augmentation, and quilting arrays, Sequence Covering Arrays and Linear Extensions, Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm, Augmentation of covering arrays of strength two, Improved strength four covering arrays with three symbols, Asymptotic and constructive methods for covering perfect hash families and covering arrays, Covering array EXtender, Randomized Post-optimization for t-Restrictions, Subspace restrictions and affine composition for covering perfect hash families, A survey on the problems and algorithms for covering arrays via set covers

Uses Software

• AETG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Largest induced subgraphs of the n-cube that contain no 4-cycles
• Covering and radius-covering arrays: constructions and classification
• The complexity of completing partial Latin squares
• Constraint models for the covering test problem
• Roux-type constructions for covering arrays of strengths three and four
• Constructing strength three covering arrays with augmented annealing
• Tabu search for covering arrays using permutation vectors
• Covering arrays from cyclotomy
• Orthogonal arrays. Theory and applications
• Upper bounds for covering arrays by tabu search.
• On \(t\)-covering arrays
• Strength two covering arrays: existence tables and projection
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• On the state of strength-three covering arrays
• Iterative Exhaustive Pattern Generation for Logic Testing
• Randomized Postoptimization of Covering Arrays
• PASCALIAN RECTANGLES MODULOm
• Group construction of covering arrays
• t-Covering Arrays: Upper Bounds and Poisson Approximations
• Binary Covering Arrays and Existentially Closed Graphs
• Products of mixed covering arrays of strength two
• Covering arrays of higher strength from permutation vectors