作者: P. Butkovic , R.A. Cuninghame-Green
DOI: 10.1016/0166-218X(92)90039-D
关键词:
摘要: Abstract For a general n × real matrix ( ij ), standard O( 3 ) algorithms exist to find its maximum cycle mean, i.e., λ A )= max i 1 2 + k l )\ over all cyclic permutations ,…, of subsets the set {1,2,…, }. We consider case when elements take values in binary { a,b } and construct an algorithm complexity which then suffices λ( ).