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.Dijkstra's algorithmNarrower topic: Finalizing the nearest unsettled vertex is Dijkstra's greedy choice.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.Huffman codingNarrower topic: Huffman construction repeatedly merges the two least frequent nodes.Probabilistic methodCompared with: Greedy constructions provide explicit witnesses where probabilistic proofs may only establish existence.HeuristicBroader topic: It illustrates a heuristic strategy that can find quick solutions without ensuring a global optimum.Divide-and-conquer algorithmCompared with: It makes successive choices rather than splitting the instance into smaller instances.Maximal elementRelated: Greedy procedures often produce maximal feasible objects, though not necessarily maximum ones.Egyptian fractionNarrower topic: The standard Egyptian fraction construction is one instance of this broader algorithmic strategy.Brooks' theoremRelated: The elementary greedy coloring bound provides a starting point for the stronger theorem.Kruskal's algorithmNarrower topic: Kruskal's algorithm chooses the lightest currently eligible edge at each step.Tower of HanoiRelated: The optimal sequence can be generated by choosing the only legal move that preserves progress.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.Gilbert–Varshamov boundRelated: The Gilbert–Varshamov argument greedily selects codewords and removes nearby candidates.Vitali covering lemmaRelated: Selecting a largest available set and discarding intersecting sets captures the lemma’s basic construction.Zeckendorf's theoremRelated: Choosing the largest Fibonacci number not exceeding the remainder constructs the representation.Richard M. KarpRelated: Greedy methods solve important optimization problems and clarify when combinatorial structure enables efficiency.
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.Dijkstra's algorithmNarrower topic: Finalizing the nearest unsettled vertex is Dijkstra's greedy choice.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.Huffman codingNarrower topic: Huffman construction repeatedly merges the two least frequent nodes.Probabilistic methodCompared with: Greedy constructions provide explicit witnesses where probabilistic proofs may only establish existence.HeuristicBroader topic: It illustrates a heuristic strategy that can find quick solutions without ensuring a global optimum.Divide-and-conquer algorithmCompared with: It makes successive choices rather than splitting the instance into smaller instances.Maximal elementRelated: Greedy procedures often produce maximal feasible objects, though not necessarily maximum ones.Egyptian fractionNarrower topic: The standard Egyptian fraction construction is one instance of this broader algorithmic strategy.Brooks' theoremRelated: The elementary greedy coloring bound provides a starting point for the stronger theorem.Kruskal's algorithmNarrower topic: Kruskal's algorithm chooses the lightest currently eligible edge at each step.Tower of HanoiRelated: The optimal sequence can be generated by choosing the only legal move that preserves progress.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.Gilbert–Varshamov boundRelated: The Gilbert–Varshamov argument greedily selects codewords and removes nearby candidates.Vitali covering lemmaRelated: Selecting a largest available set and discarding intersecting sets captures the lemma’s basic construction.Zeckendorf's theoremRelated: Choosing the largest Fibonacci number not exceeding the remainder constructs the representation.Richard M. KarpRelated: Greedy methods solve important optimization problems and clarify when combinatorial structure enables efficiency.