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-8MaRDI QIDQ1086161zbMATH OpenOpenAlexFDO

Authors Michele Conforti, Gérard Cornuéjols

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 algorithmindependence systemmatroidsubmodular set functionworst case bound

Mathematics Subject Classification ID

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086161)