Greedy Algorithms University of Winnipeg贪婪算法温尼伯大学.pptVIP

greedy - * Sept. 2015 Greedy Algorithms General principle of greedy algorithm Activity-selection problem - Optimal substructure - Recursive solution - Greedy-choice property - Recursive algorithm Minimum spanning trees - Generic algorithm - Definition: cuts, light edges - Prim’s algorithm Overview Like dynamic programming (DP), used to solve optimization problems. Problems exhibit optimal substructure (like DP). Problems also exhibit the greedy-choice property. 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 globa