User menu

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

Bibliographic reference Conforti, M. ; Cornuejols, G.. Submodular Set-functions, Matroids and the Greedy Algorithm - Tight Worst-case Bounds and Some Generalizations of the Rado-edmonds Theorem. In: Discrete Applied Mathematics, Vol. 7, no. 3, p. 251-274 (1984)
Permanent URL http://hdl.handle.net/2078.1/56269