Abstract: Existence and reconstruction issues are considered for a class of (0,1)-matrices with different rows. Intending to define quantitative characteristics, maximization of which lead to matrices with different rows in case when the later exist, we consider the number of pairs of different rows.A greedy algorithm is introduced for this purpose and then its optimality is proven for local steps.

Keywords: (0,1)-matrices, greedy algorithms

ACM Classification Keywords: F.2.2 Nonnumerical Algorithms and Problems:Computations on discrete structures

Link:

APPROXIMATION GREEDY ALGORITHM FOR RECONSTRUCTING OF (0,1)-MATRICES WITH DIFFERENT ROWS

Hasmik Sahakyan

http://www.foibg.com/ijita/vol17/ijita17-2-p02.pdf