Submodular Set-functions, Matroids and the Greedy Algorithm - Tight Worst-case Bounds and Some Generalizations of the Rado-edmonds Theorem

Conforti, M., & Cornuejols, G. (1984). Submodular Set-functions, Matroids and the Greedy Algorithm - Tight Worst-case Bounds and Some Generalizations of the Rado-edmonds Theorem. Discrete Applied Mathematics, 7(3), 251-274. https://doi.org/10.1016/0166-218X(84)90003-9 (Original work published 1984)