KnowraGreedy algorithmLinked fromLinked fromThe 19 pages that link to Greedy algorithm, each with the reason it gives.All 19Broader topic 1Related 7Narrower topic 4Compared with 7Dynamic programmingCompared with: Greedy methods avoid exploring full subproblem tables but require a stronger choice property.BacktrackingCompared with: Greedy methods commit to choices, while backtracking can retract them after discovering a dead end.Augmenting pathCompared with: Augmenting paths can use reverse edges to revise earlier flow choices rather than commit irreversibly.Probabilistic methodCompared with: Greedy constructions provide explicit witnesses where probabilistic proofs may only establish existence.Divide-and-conquer algorithmCompared with: It makes successive choices rather than splitting the instance into smaller instances.Hungarian algorithmCompared with: Choosing the cheapest remaining edge greedily can fail to produce a minimum-cost perfect matching.Blossom algorithmCompared with: Greedy edge selection can get stuck below the maximum matching size.