Construct · 1 fields · 1 citations

greedy algorithm: a standalone construct

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

● anchor · one construct, one field Nearest construct by meaning·not indexed
greedyalgorithm1 CONSTRUCTGreedy algorithmCLRS · GREEDY

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

Computer science

Take the locally best choice at each step

A greedy algorithm solves an optimization problem by making the choice that looks best at each step and never reconsidering it, building a solution one locally optimal decision at a time. For problems with the right structure (the greedy-choice property and optimal substructure, as in minimum spanning trees or Huffman coding) this yields a provably optimal answer; for many others it is a fast heuristic that can fall short of the best solution. Cormen, Leiserson, Rivest, and Stein's Introduction to algorithms gives the standard treatment of when greedy choices are guaranteed optimal. The referent is this stepwise locally optimal decision strategy.[1]

Unit
The sequence of locally optimal choices building a solution
Recovery means
Not applicable
Measured by
Judged by whether the greedy solution is provably optimal, for instance via matroid theory, or by its approximation ratio when it is not

Next

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

See how greedy algorithm 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

fall2 fields · 3 citationsjingle · one word, two constructsheuristic4 fields · 4 citationsjingle · one word, four constructsproperty4 fields · 4 citationsjingle · one word, four constructs

References

  1. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to algorithms (3rd ed.). MIT Press. ISBN 9780262033848

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