A Characterization of Nonnegative Box-Greedy Matrices

DOI10.1137/0409001zbMATH Open0842.90095OpenAlexW2003901401MaRDI QIDQ4875430FDOQ4875430

Walter Kern, Alan J. Hoffman, U. Faigle

Publication date: 24 April 1996

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/a-characterization-of-nonnegative-greedy-matrices(74a798d2-3a75-4558-bb58-aeddc371e704).html

Recommendations

• On the characterization of totally nonpositive matrices
• A note on comparison theorems for nonnegative matrices
• On nonnegative factorization of matrices
• scientific article; zbMATH DE number 1135796
• Nonnegative splittings for rectangular matrices
• A characterization of a class of non-binary matroids
• Bounds for the greatest characteristic root of a nonnegative matrix
• On characterizing \(N\)-matrices using linear complementarity
• Comparisons of nonnegative splittings of matrices
• The nonnegative rank factorizations of nonnegative matrices

zbMATH Keywords

greedy algorithmNP-completeforbidden submatricespolynomial recognition algorithmsclasses of greedy matrices

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cited In (3)

• In memoriam Walter Kern
• Greedy oriented flows
• Greedy sets and related problems

This page was built for publication: A Characterization of Nonnegative Box-Greedy Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875430)