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

Michele Conforti, Gérard Cornuéjols

Source record

Source: Crossref

Published: Mar 1, 1984

DOI: 10.1016/0166-218x(84)90003-9

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.