Randomized Postoptimization of Covering Arrays

  • Authors:

  • Peyman Nayeri;Charles J. Colbourn;Goran Konjevod

  • Affiliations:

  • Computer Science and Engineering, Arizona State University, Tempe, U.S.A. 85287;Computer Science and Engineering, Arizona State University, Tempe, U.S.A. 85287;Computer Science and Engineering, Arizona State University, Tempe, U.S.A. 85287

  • Venue:
  • Combinatorial Algorithms
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. While some is necessary, some is not. By reducing the repeated coverage, metaheuristic search techniques typically outperform simpler computational methods, but they have been applied in a limited set of cases. Time constraints often prevent them from finding an array of competitive size. We examine a different approach. Having used a simple computation or construction to find a covering array, we employ a postoptimization technique that repeatedly adjusts the array in order to (sometimes) reduce its number of rows. At every stage the array retains full coverage. We demonstrate its value on a collection of previously best known arrays by eliminating, in some cases, 10% of their rows. In the well-studied case of strength two with twenty factors having ten values each, postoptimization produces a covering array with only 162 rows, improving on a wide variety of computational and combinatorial methods. We identify certain important features of covering arrays for which postoptimization is successful.