2018-03-01
The Lovász Local Lemma and Variable Strength Covering Arrays
Publication
Publication
Electronic Notes in Discrete Mathematics , Volume 65 p. 43- 49
We use the probabilistic method to obtain an upper bound on the number of rows of variable strength covering arrays. We then compare the power of this upper bound with another one given by a density-based greedy algorithm.
| Additional Metadata | |
|---|---|
| covering arrays, greedy algorithm, local lemma, variable strength | |
| dx.doi.org/10.1016/j.endm.2018.02.019 | |
| Electronic Notes in Discrete Mathematics | |
| Organisation | School of Mathematics and Statistics |
|
Moura, L. (Lucia), Raaphorst, S. (Sebastian), & Stevens, B. (2018). The Lovász Local Lemma and Variable Strength Covering Arrays. Electronic Notes in Discrete Mathematics, 65, 43–49. doi:10.1016/j.endm.2018.02.019
|
|