EVALUATION OF GREEDY ALGORITHM OF CONSTRUCTING (0,1)-MATRICES WITH DIFFERENT ROWS 1
Hasmik Sahakyan, Levon H. Aslanyan · 2011
An approximation greedy algorithm is considered for reconstruction of (0,1)-matrices with different rows. Numbers of pairs of different rows is taken up as a quantitative characteristic, maximization of which, when appropriate, leads to matrices with different rows. Properties of the algorithm are studied and the performance is evaluated based on series of experiments.