6 docs tagged with "greedy"

Maximum-cardinality interval scheduling by earliest finish time.

Density-ordered selection when items are continuously divisible.

Local-choice algorithms organized around proof obligations and counterexamples.

Optimal binary prefix codes for known symbol frequencies.

The cut property connecting Prim's and Kruskal's safe edge choices.

Profit-maximizing unit jobs scheduled into their latest feasible slots.