Construct · 1 fields · 1 citations

submodularity: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
submodularity1 CONSTRUCTSubmodularityNEMHAUSER · COMBINATORIAL

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Combinatorial optimization

the diminishing-returns property of set functions, under which greedy selection reaches at least 1 - 1/e of the optimum for monotone maximization under a cardinality limit.

In combinatorial optimization, submodularity refers to the diminishing-returns property of set functions, under which greedy selection reaches at least 1 - 1/e of the optimum for monotone maximization under a cardinality limit. This meaning comes from Nemhauser (1978) in Mathematical Programming.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how submodularity sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

limit3 fields · 3 citationsjingle · one word, three constructsproperty4 fields · 4 citationsjingle · one word, four constructsselection4 fields · 5 citationsjingle · one word, four constructs

References

  1. Nemhauser, G. L., Wolsey, L. A., & Fisher, M. L. (1978). An analysis of approximations for maximizing submodular set functions: I. Mathematical Programming, 14(1), 265-294. https://doi.org/10.1007/bf01588971

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct