Density-based greedy algorithm

Implementation of the density based greedy algorithm for generating higher strength covering arrays, as given in this paper. Project under Prof. Soumen Maity, IISER Pune.

About the code

• Specifically for 3-way coverage of any k,v configuration.

Instructions

git clone https://github.com/smittal6/greedy-covering.git
cd greedy-covering
octave

• Once Octave is running, in the command window run clear all; gthree.
• Variable 'cover' holds the covering array generated.

To-do list

• Resolving duplicate test case generation issue
• Generalizing t-tuple generation
• Trying different greedy versions of the algorithm