The complexity of finding the minimal of the maximum cycle means of similar zero-one matrices
From MaRDI portal
Publication:4764873
Recommendations
- An O(n^ 2) algorithm for the maximum cycle mean of an n n bivalent matrix
- An \(O(n^{2}\)) algorithm for maximum cycle mean of Monge matrices in max-algebra.
- scientific article; zbMATH DE number 2104735
- On the computation of maximum minors of Hadamard matrices
- On the approximability of the minimum strictly fundamental cycle basis problem
- On the complexity of approximating extremal determinants in matrices
- Tight bounds on the number of minimum-mean cycle cancellations and related results
- scientific article; zbMATH DE number 2089223
- On the dependence of the maximum cycle mean of a matrix on permutations of the rows and columns
- The minimum rank problem for circulants
Cited in
(8)- The robustness of interval matrices in max-plus algebra
- \(\ell\)-parametric eigenproblem in max-algebra
- On Eigenproblem for Circulant Matrices in Max-Algebra
- Permuted max-algebraic eigenvector problem is \(NP\)-complete
- The weak robustness of interval matrices in max-plus algebra
- On the dependence of the maximum cycle mean of a matrix on permutations of the rows and columns
- An \(O(n^{2}\)) algorithm for maximum cycle mean of Monge matrices in max-algebra.
- scientific article; zbMATH DE number 1516306 (Why is no real title available?)
This page was built for publication: The complexity of finding the minimal of the maximum cycle means of similar zero-one matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764873)
