Combinatorial aspects of covering arrays

238 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Classification of Orthogonal Arrays by Integer Programming (2008, background): “(2006) proves several of the upper bounds for |CA∗1(k, s, t)| in Colbourn (2006) and Colbourn et. al.”
Covering arrays on graphs: Qualitative independence graphs and extremal set partition theory (2007, background): “75]. 2.4.1 Constructions for Covering Arrays In light of this application, there has been much research to ﬁnd constructions of covering arrays with the fewest possible columns [13, 66, 70]. Colbourn [19] gives a comprehensive survey of results for covering arrays. Determining the exact value of CAN”
An orchestrated survey of methodologies for automated software test case generation (2013, background): “There is a long history of research on the mathematics of covering arrays which we do not attempt to cover, but instead refer the reader to two excellent surveys, one by Colbourn (2004) and another by Hartman and Raskin (2004).”