A greedy algorithm to construct covering arrays using a graph representation.

Jose Torres-Jimenez Jose Carlos Perez-Torres

Published in: Inf. Sci. (2019)

Keyphrases

greedy algorithm
graph representation
covering arrays
graph model
greedy algorithms
worst case
test cases
dynamic programming
greedy strategy
objective function
context free grammars
influence maximization
knapsack problem
keywords
computational complexity