For a general real matrix, standard algorithms exist to find its maximum cycle mean, i.e., to find over all cyclic permutations of subsets of the set . The authors consider the case when all the elements take values in a binary set and construct an algorithm of complexity which then suffices to find .
