算法课件全121301ADA16贪心法.pptVIP

2007-2008-01《Design and Analysis of Algorithms》SCUEC Goals of This Lecture At the end of this lecture, you should Understand the basic idea and general solving process of greedy approach Master the properties and greedy selection strategies of MST problem Master Dijkstra algorithm and its application Example: Change-Making Problem The solution is optimal for any amount and “normal’’ set of denominations may not be optimal for arbitrary money denominations Greedy Technique For some problems, yields an optimal solution for every instance. For most, does not but can be useful for fast approximations. Greedy Technique (cont.) Given a positive answer is very hard, but generally speaking, the problem has two important properties: Optimal substructure property: the optimal solution of the problem contains the optimal solution of its subproblem Greedy selection property: the global optimal solution of the problem can be achieved through a series of local optimal choice Solving Process of Greedy Approach MST Problem (Concept) Minimum spanning tree of a weighted, connected graph G: a spanning tree of G of minimum total weight Discussion Is the minimum spanning tree of graph always unique? yes, provide examples no, why? try to find out what kind of graphs has a unique mst Optimal substructure property MSTs satisfy the optimal substructure property: an optimal tree is composed of optimal subtrees Let T be an MST of G with an edge (u,v) in the middle Removing (u,v) partitions T into two trees T1 and T2 Claim: T1 is an MST of G1 = (V1,E1), and T2 is an MST of G2 = (V2,E2) (Do V1 and V2 share vertices? Why?) Proof: w(T) = w(u,v) + w(T1) + w(T2) Greedy selection strategy The shortest edge strategy (kruskal algorithm): in each greedy selection step, choose the shortest edge, if not generate cycle when add it to the edge set of the spanning tree, then add it to the edge set of the spanning tree. Single-Source Shortest Path E.g., a road map: what is the shortest path from Wuh