Next:
Greedy Algorithms
Proving Greedy Algorithms Optimal
Example: Fractional Knapsack Problem
Question:
The Fractional Knapsack Problem exhibits Optimal Substructure
Fractional Knapsack Problem exhibits Greedy Choice Property
Fractional Knapsack Problem
Activity-Selection (scheduling) problem
Activity Selection Problem
Dynamic Programming for Activity Selection
0-1 Knapsack Problem
Dynamic Programming for 0-1 Knapsack Problem
Huffman Codes
Prefix Codes
Prefix Codes
Greedy Algorithm for Huffman Code
Example
Lemma 17.2
Lemma 17.3
Example
Applications
Next: