Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem. A correction

DOI10.1016/0166-218X(87)90075-8zbMath0608.90078OpenAlexW4206055417MaRDI QIDQ1086161

Michele Conforti, Cornuéjols, Gérard

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(87)90075-8

zbMATH Keywords

greedy algorithm matroid independence system submodular set function worst case bound

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

This page was built for publication: Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem. A correction