简单审核装配线调度let9-dynamic programming 2LET9 DYNAGIC编程.pptx

SimpleReviewAssembly-lineschedulingf*=min(f1[n]+x1,f2[n]+x2)Matrix-chainmultiplication

Matrix-ChainMultiplicationDPAlgo.O(n3)

Example:DPforMCMTheoptimalsolutionis((A1(A2A3))((A4A5)A6)

ConstructanOptimalSolutionThefinalmatrixmultiplicationincomputingA1..noptimallyisA1..s[1,n]As[1,n]+1..n.s[1,s[1,n]]determinesthelastmatrixmultiplicationincomputingA1..s[1,n]ands[s[1,n]+1,n]determinesthelastmatrixmultiplicationincomputingAs[1,n]+1..n.

Homework15.1-1,15.2-1

DesignandAnalysisofAlgorithms

DynamicProgramming(Ch15)

Part2

DesignandAnalysisofAlgorithmsDynamicProgrammingTopics:ElementsofDPAlgorithmsLongestCommonSubsequence

ElementsofDPAlgorithmsOptimalsubstructure(principleofoptimality)Anoptimalsolutiontotheproblemcontainswithinitsoptimalsolutionstosubproblems.Optimalsubstructurevariesacrossproblemdomainsintwoways:HowmanysubproblemsareusedinanoptimalsolutiontotheoriginalproblemHowmanychoiceswehaveindeterminingwhichsubproblem(s)touseinanoptimalsolution.

ElementsofDPAlgorithmsInassembly-lineschedulingWehadΘ(n)subproblemsoverallandonlytwochoicestoexamineforeach,yieldingaΘ(n)runningtime.f*=min(f1[n]+x1,f2[n]+x2)Formatrix-chainmultiplicationTherewereΘ(n2)subproblemsoverall,andineachwehadatmostn–1choices,givinganO(n3)runningtime.

OptimalsubstructureOptimalsubstructuredoesnotapplytoalloptimizationproblems.Example.GivenadirectedgraphG=(V,E),andapairofverticesuandv:Shortestpathfindapathu~vwiththefewestedges.Longestpathfindapathu~vwiththemostedges.Shortestpathhasoptimalsubstructure.Proof.Ifthere’sashorterpathfromutow,callitp’1,thenp’1p2containsashorterpaththanp1p2fromutov,whichcontradictstheassumption.

OptimalsubstructureLongestpathdoesnothaveoptimalsubstructure.Longestpathfromqtot:q→r→t.Longestpathfromrtot:r