Well-layered maps---a class of greedily optimizable set functions (Q1904519)

The paper contains a characterization of the well-layered maps by an appropriate quantified version of the greedoid exchange condition. The authors hope that this theorem can be applied to a problem discussed by Murota, viz. the problem of finding a \(k\)-subdeterminant of highest degree in an \(n \times n\)-matrix, whose entries are rational polynomials in one or several variables.