@article { author = {Colbourn, Charles and Torres-Jimenez, Jose}, title = {Profiles of covering arrays of strength two}, journal = {Journal of Algorithms and Computation}, volume = {44}, number = {1}, pages = {31-59}, year = {2013}, publisher = {University of Tehran}, issn = {2476-2776}, eissn = {2476-2784}, doi = {10.22059/jac.2013.7914}, abstract = {Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques can overcome these computational difficulties, but for strength two do not appear to yield a number of tests that is competitive with the fewest known.}, keywords = {covering array,interaction testing,direct product,simulated annealing}, url = {https://jac.ut.ac.ir/article_7914.html}, eprint = {https://jac.ut.ac.ir/article_7914_15663cf03a41c7a363532a169150be93.pdf} }