A density-based greedy algorithm for higher strength covering arrays.

Renée C. Bryce Charles J. Colbourn

Published in: Softw. Test. Verification Reliab. (2009)

Keyphrases

greedy algorithm
covering arrays
greedy algorithms
worst case
objective function
test cases
context free grammars
influence maximization
dynamic programming
knapsack problem
special case
greedy strategy
greedy heuristic
submodular functions
set cover
graph cuts
influence spread
greedy approximation algorithm