Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm

The generation of covering arrays, which can be regarded as a generalization of orthogonal arrays, is an active research field. In this paper, we propose a memory efficient variant of the well-known AETG greedy algorithm for covering array generation called sliced AETG. The memory usage and runtime of sliced AETG is greatly decreased when compared to that of the original algorithm. We further show asymptotic results regarding the runtime and the number of rows of the generated arrays, which are the same as that of greedy AETG, for fixed alphabet and strength. However, as our experimental evaluation shows, the generated CAs have more rows than those produced by the original version.