|  Introduction to Algorithms, 2/e Greedy Algorithms Chapter ObjectivesSimilar to dynamic programming.Used for optimization problems. Idea: When we have a choice to make, make the one that looks best right now. Make a locally optimal choice in hope of getting a globally optimal solution. Greedy algorithms don’t always yield an optimal solution. But sometimes they do. We’ll see a problem for which they do. Then we’ll look at some general characteristics of when greedy algorithms give optimal solutions. [We do not cover Huffman codes or matroids in these notes.]
|
2002 McGraw-Hill Higher EducationAny use is subject to the Terms of Use and Privacy Policy.
McGraw-Hill Higher Education is one of the many fine businesses of The McGraw-Hill Companies.