浙江大在学ds05ch10aa高级数据结构课件.pptVIP

* CHAPTER 10 ALGORITHM DESIGN TECHNIQUES §1 Greedy Algorithms ? Optimization Problems: Given a set of constrains and an optimization function. Solutions that satisfy the constrains are called feasible solutions. A feasible solution for which the optimization function has the best possible value is called an optimal solution. ? The Greedy Method: Make the best decision at each stage, under some greedy criterion. A decision made in one stage is not changed in a later stage, so each decision should assure feasibility. 1/12 §1 Greedy Algorithms 2/12 Note: Greedy algor