Discrete Convex Analysis XIX: Discrete Separation for M-Convex SetsTextbook
Submodular set functions are the combinatorial stand-in for convexity: a function on the subsets of a finite ground set is submodular if , and this single diminishing-returns inequality drives an enormous range of combinatorial optimization — matroid rank functions, graph cut…