【2017年整理】算法设计与分析双语课Chapter 5 -1Gready algorithm.pptVIP

算法设计与分析;North China Electric Power University;North China Electric Power University; Unlike dynamic programming algorithms, greedy algorithms typically consist of an iterative procedure that tries to find a local optimal solution. A greedy algorithm makes a correct guess on the basis of little calculation without worrying about the future. Thus it builds a solution step by step. Each step increases the size of the partial solution and is based on local optimization. The choice made is that which produces the largest immediate gain while maintaining feasibility. ;How can one tell if a greedy algorithm will solve a;Greedy choice property;Steps of Greedy Algorithm 1. Cast the optimization problem as one in which we make a choice and are left with one subproblem to solve.;§2 Fractional knapsack problem;North China Electric Power University;North China Electric Power University;North China Electric Power University;;Both knapsack problems exhibit the optimal substructure property:;North China Electric Power University;North China Electric Power University;North China Electric Power University;North China Electric Power University;Example;North China Electric Power University;Proof By induction on the orders in which vertices leave the set Y and enter X. The first vertex to leave is 1 and we have . Assume that the statement is true for all vertices which left Y before y. Since is finite, there must exists a path from 1 to y whose length is . Now, we show that .Let be a shortest path from 1 to y , where x is the rightmost vertex to leave Y before y. We have;§4 Minimum cost spanning trees problem;Kruskal’s Algorithm;North China Electric Power University;North China Electric Power University;Correctness; We observe that cost(e’)≥ cost(e); for otherwise e’ would have been added before since it does not create a cycle with the edges of T* which contains the edges of T