《算法设计技巧与分析》第8章 贪心算法（英文）-教学课件（非AI生成）.ppt

Chapter8

Thegreedyapproach—Anefficientapproachforoptimizationproblems

Whatwehaveknownafterpreviouslearning…DynamicprogramminganditsgeneraldiagramOptimalsubstructureThelongestcommonsubsequenceproblemMatrixchainmultiplicationTheall-pairsshortestpathproblemTheknapsackproblem

ContentsofcurrentchapterIntroductionoftheGreedyApproachTheshortestpathproblemMinimumcostspanningtreesKruskal’sAlgorithmPrim’sAlgorithmFilecompression

8.1IntroductionComparedwiththeDynamicProgrammingAlgorithms:Greedyalgorithmsaredesignedtosolveoptimizationproblemsinwhichaquantityistobeminimizedormaximized,too.ButGreedyalgorithmstypicallyconsistofaniterativeprocedurethattriestofindalocaloptimalsolution.Insomeinstances,theselocaloptimalsolutionstranslatetoglobaloptimalsolutions.Inothers,theyfailtogiveoptimalsolutions.

BasicideaAgreedyalgorithmmakesacorrectguessonthebasisoflittlecalculationwithoutworryingaboutthefuture.Itbuildsasolutionstepbystep.Eachstepincreasesthesizeofthepartialsolutionandisbasedonlocaloptimization.Thechoicemadeisthatwhichproducesthelargestimmediategainwhilemaintainingfeasibility.Sinceeachstepconsistsoflittleworkbasedonasmallamountofinformation,theresultingalgorithmsaretypicallyefficient.

Anexample:FractionalKnapsackProblemProblemdescription:Givennitemsofsizess1,s2,...,sn,andvaluesv1,v2,...,vnandsizeC,theknapsackcapacity,theobjectiveistofindnonnegativerealnumbersx1,x2,…xnthatmaximizethesumSubjecttotheconstraint

Examplen=3,C=20,(v1,v2,v3)=(25,24,15), (s1,s2,s3)=(18,15,10)Feasiblesolutions: (x1,x2,x3) ?sixi ?vixi (1)(1/2,1/3,1/4) 16.5 24.5 (2)(1,2/15,0) 20 28.2 (3)(0,2/3,1) 20 31 (4)(0,1,1/2) 20 31.5

Selectionstrategy-1Choosetheonewiththemaximalvaluefromtheremainitemsintotheknapsack.Solution(2)(1,2/15,0) 20