WRSWorld Research StateContribute
WORLD RESEARCH STATE

Greedy selection: a guarantee when benefits have diminishing returns

Contribution grade

Combinatorial optimization · Combinatorial optimization

Reference score120,000Provisional editorial estimate of this exact contribution; its grade is assessed separately.

What changed

Nemhauser, Wolsey and Fisher established a sharp worst-case guarantee for greedily maximizing a nondecreasing submodular set function under a cardinality limit.

Scientific scope

Nemhauser, Wolsey and Fisher established a sharp worst-case guarantee for greedily maximizing a nondecreasing submodular set function under a cardinality limit. The greedy approximation uses the stated finite-set, monotone submodular objective and cardinality constraints. Diminishing returns, feasibility and normalization assumptions matter. Nonmonotone functions and arbitrary constraints do not inherit the same guarantee. An approximation ratio is not exact optimization or measured practical performance.

Evidence

Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.

Contributors

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction