There are several interesting generalizations of matroids. We have already seen independence systems in Section 13.1, which arose from dropping the axiom (M3). In Section 14.1 we consider greedoids, arising by dropping (M2) instead. Moreover, certain polytopes related to matroids and to submodular functions, called polymatroids, lead to strong generalizations of important theorems; we shall discuss them in Section 14.2. In Sections 14.3 and 14.4 we consider two approaches to the problem of minimizing an arbitrary submodular function: one using the ELLIPSOID METHOD, and one with a combinatorial algorithm. For the important special case of symmetric submodular functions we mention a simpler algorithm in Section 14.5.
CITATION STYLE
Korte, B., & Vygen, J. (2018). Generalizations of Matroids (pp. 359–384). https://doi.org/10.1007/978-3-662-56039-6_14
Mendeley helps you to discover research relevant for your work.