算法导论Let10-Greedy Algorithms.pptVIP

Design and Analysis of AlgorithmsGreedy Algorithms (Ch16) Simple Review LCS Max Sum b[j]=max( b[j-1]+a[j], a[j] ), 1=j=n. Examples of Greedy Algorithms Scheduling Activity Selection (Chap 16.1) Minimizing time in system Deadline scheduling (Chap 16.5) Graph Algorithms Minimum Spanning Trees (Chap 23) Dijkstra’s (shortest path) Algorithm (Chap 24.3) Other Heuristics Huffman coding (Chap 16.3) Coloring a graph Traveling Salesman Problem(Chap 35.2) Set-covering (Chap 35.3) Subset-sum problem (Chap 35.5) Greedy Method For many optimization problem, Dynamic Programming is overkill. A greedy algorithm always make the choice that looks best at every step. That is, it makes local optimal solution in the hope that this choice will lead to a globally optimal one. I make the shortest path to the target at each step. Sometime I win, sometime I lose. Activity-Selection Problem Problem: Given a set A = {a1, a2, …, an} of n activities with start and finish times (si, fi), 1 ≤ i ≤ n, select maximal set S of “non-overlapping” activities. One can think of the problem as corresponding to scheduling the maximal number of classes (given their start and finish times) in one classroom. Solution: Sort activities by finish times (let a1, a2 , …, an denote sorted sequence) Pick first activity a1 Remove all activities with start time before finish time of a1 Recursively solve problem on remaining activities. Activity Selection Here is the problem from the book: Activity a1 starts at s1 = 1, finishes at f1 = 4. Activity a2 starts at s2 = 3, finishes at f2 = 5. Activity a3 starts at s3 = 0, finishes at f3 = 6 ... Got the idea? The set S is sorted in monotonically increasing order of finish time.The subsets of {a3, a9, a11} and {a1, a4, a8 , a11}are mutually compatible. Activity Selection Activity Selection Objective: to create a set of maximum activities ai that are compatible. Modeling the subproblems: Create a set of activities that can start after ai finishes, and finish before activ