Outline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique

Transcription

1 Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson Dynamc Programmng verson Dynamc Programmng revealed Brea problem nto subproblems that are shared have subproblem optmalty (optmal subproblem soluton helps solve overall problem) subproblem optmalty means can wrte recursve realtonshp between subproblems! Defnng subproblems s hardest part! Compute solutons to small subproblems Store solutons n array A. Combne already computed solutons nto solutons for larger subproblems Solutons Array A s teratvely flled (Optonal: reduce space needed by reusng array) Dynamc Programmng verson Computng Fbonacc Dynamc Programmng s a general algorthm desgn paradgm: Iteratvely solves small subproblems whch are combned to solve overall problem. Fbonacc numbers defned F = F 1 = 1 F n = F n-1 + F n-2, for n > 1 Recursve soluton: nt fb(nt x) f (x=) return ; f (x=1) return 1; return fb(x-1) + fb(x-2); Dynamc Programmng Soluton: f[]=; f[1]=1; for 2 to x do f[] f[-1] + f[-2]; return f[x]; Dynamc Programmng verson Reducng Space for Computng Fbonacc store only prevous 2 values to compute next value nt fb(x) f (x=) return ; f (x=1) return 1; nt last 1; nextlast ; for 2 to x do temp last + nextlast; nextlast last; last temp; return temp; The General Dynamc Programmng Technque Apples to a problem that at frst seems to requre a lot of tme (possbly exponental), provded we have: Smple subproblems: the subproblems can be defned n terms of a few varables, such as, l, m, and so on. Subproblem optmalty: the global optmum value can be defned n terms of optmal subproblems Subproblem overlap: the subproblems are not ndependent, but nstead they overlap (hence, should be constructed bottom-up). Dynamc Programmng verson Dynamc Programmng verson 1.4 6

2 The /1 Knapsac Problem Gven: A set S of n tems, wth each tem havng b - a postve beneft w - a postve weght Goal: Choose tems wth maxmum total beneft but wth. If we are not allowed to tae fractonal amounts, then ths s the /1 napsac problem. In ths case, we let T denote the set of tems we tae Obectve: maxmze Constrant: w W b T T Dynamc Programmng verson Example Items: Gven: A set S of n tems, wth each tem havng b - a postve beneft w - a postve weght Goal: Choose tems wth maxmum total beneft but wth. napsac Weght: Beneft: n 2 n 2 n 6 n 2 n $2 $3 $6 $25 $8 9 n Soluton: 5 (2 n) 3 (2 n) 1 (4 n) Dynamc Programmng verson A /1 Knapsac, Frst Attempt S : Set of tems numbered 1 to. Defne ] = best selecton from S. Problem: does not have subproblem optmalty: Consder S={(3,2),(5,4),(8,5),(4,3),(1,9)} beneft-weght pars Best for S 4 : Best for S 5 : Dynamc Programmng verson A /1 Knapsac, Second Attempt S : Set of tems numbered 1 to. Defne = best selecton from S wth weght exactly equal to w Good news: ths does have subproblem optmalty: >, w w } I.e., best subset of S wth weght lmt exactly w s ether the best subset of S -1 w/ weght w or the best subset of S -1 w/ weght w-w plus beneft of tem. Dynamc Programmng verson w Towards the /1 Knapsac S : Set of tems numbered 1 to = {(b 1,w 1 ), (b 2,w 2 ),, (b,w )} Defne = maxmum beneft of optmal subset from S wth total weght at most Recursve defnton of :, w } f = otherwse Dynamc Programmng verson Towards the /1 Knapsac f =, w } otherwse rec1knap(s, W): = maxmum beneft Input: set S of tems w/ beneft b 1, b 2, b of optmal subset from S,; weghts w 1, w 2, w and max. weght W wth total weght at most Output: beneft of best subset wth Recursve verson of f = then {S = emptyset} algorthm based on return recursve subproblem remove tem (beneft-weght (b,w )) relatonshp. from S Not a dynamc f w > W then {tem does not ft} return rec1knap(s,w) programmng verson. return max(rec1knap(s,w), rec1knap(s,w-w ) + b ) Dynamc Programmng verson

3 Towards the /1 Knapsac Modfed recursve verson that stores subproblem solutons Frst allocate global array B of sze n+1 by W Then ntalze all entres of, to 1 B stores results of recursve calls Entres n B are computed when necessary Ths s consdered a dynamc programmng verson., w ] + b } f = otherwse rec1knap(s, W): Input: set S of tems w/ beneft b 1, b 2,,b,; weghts w 1, w 2, w and max. weght W Output: beneft of best subset wth f = then return remove tem (beneft-weght (b,w )) from S f -1, W]= 1 then -1,W]=rec1Knap(S,W) f w > W then return -1, W] f -1, W- w ]= 1 then -1,W - w ]=rec1knap(s,w -w ) return max(-1, W], -1,W - w ]+b ) Dynamc Programmng verson The /1 Knapsac - Iteratve f =, w } otherwse 1Knapsac(S, W): Input: set S of n tems w/ beneft b Recursve computaton and weght w ; max. weght W not necessary Output: beneft of best subset wth Compute teratvely, for w to W do {base case} bottom-up, All -1,*] must be for 1 to n do computed before *] for 1 to W do because of subproblem f w then dependences -1, Ths s also dynamc max(-1,, programmng. -1,-w Dynamc Programmng verson 1.4 ]+b ) 14 The /1 Knapsac - Iteratve The /1 Knapsac - Iteratve f = f =, w } otherwse, w } otherwse 1Knapsac(S, W): 1Knapsac(S, W): Input: set S of n tems w/ beneft b Input: set S of n tems w/ beneft b Not necessary to use all the and weght w ; max. weght W Not necessary to use all the and weght w space ; max. weght W space Output: beneft of best subset wth Output: beneft of best subset wth Keep trac of one row at a Keep trac of one row at a tme for w to W do {base case} tme for w to W do {base case} Overwrte results from, Overwrte results from prevous row as new values for 1 to n do prevous row as new values for 1 to n do computed for W downto 1 do computed for W downto 1 do Must compute rght to left (W f w then Must compute rght to left (W f w then downto 1) so that the next -1, downto 1) so that the next row (*]) uses results from row (*]) uses results from the prevous row (-1,*]). the prevous row (-1,*]). max(-1,, max(, Smplfy ths to get verson n -1, -w ]+b ) Smplfy ths to get verson n -w ]+b ) boo. Dynamc Programmng verson boo. Dynamc Programmng verson The /1 Knapsac > w, w w } 1Knapsac(S, W): The boo verson: Input: set S of n tems w/ beneft b When value does not change and weght w ; max. weght W from one row to the next, Output: beneft of best subset wth then no need to assgn same value. for w to W do Runnng tme: O(nW). Not a polynomal-tme for 1 to n do algorthm f W s large for w W downto w do Ths s a pseudo-polynomal f w-w ]+b > then tme algorthm w-w ]+b Dynamc Programmng verson lne-breang problem Gven sequence of words from one paragraph Return where lne-breas should occur Mnmze empty space on each lne (except for last lne of paragraph) Dynamc Programmng verson

4 lne-breang problem Example problem A smple verson: letters and spaces have equal wdth nput s set of n word lengths, w 1, w 2, w n also gven lne wdth lmt L. each length w ncludes one space Placng words up to on one lne means w L = w = Penalty for extra spaces X = L s X 3 Mnmze sum of penaltes from each lne (no last lne penalty) Dynamc Programmng verson Paragraph s: Those who cannot remember the past are condemned to repeat t. Word lengths are 6,4,7,9,4,5,4,1,3,7,4. Suppose lne wdth L = 17. Fnd an optmal way of separatng words nto lnes that mnmzes penalty. Dynamc Programmng verson lnebrea DP lnebrea DP cost for n-1 downto do f (w[] + w[+1] + + w[n-1] < L) lne] ; mncost Infnty; 1; whle ( words startng from w[] ft on a lne) // meanng (w[] + w[+1] + + w[+-1] <= L) lnecost penalty from placng words w[] to w[+-1] on one lne. totalcost lnecost + lne+]; mncost mn(totalcost, mncost) // trac mn. so far ++; lne]=mncost; O(nL); L s maxmum wdth Lnear f L s consdered constant Space O(n). Dynamc Programmng verson Dynamc Programmng verson Matrx Chan-Products Revew: Matrx Multplcaton. C = A*B A s d e and B s e f e 1 = C[, A[, ]* = O(def ) tme (def multplcatons) d A e e B C f, d Matrx Chan-Products Matrx Chan-Product: Compute A=A *A 1 * *A n-1 A s d d +1 Problem: How to parenthesze? [for mnmzng ops] Example B s 3 1 C s 1 5 D s 5 5 (B*C)*D taes = 1575 ops B*(C*D) taes = 4 ops Dynamc Programmng verson f Dynamc Programmng verson

5 An Enumeraton Approach Matrx Chan-Product Alg.: Try all possble ways to parenthesze A=A *A 1 * *A n-1 Calculate number of ops for each one Pc the one that s best Runnng tme: The number of paranetheszatons s equal to the number of bnary trees wth n nodes Ths s exponental! It s called the Catalan number, and t s almost 4 n. Ths s a terrble algorthm! Dynamc Programmng verson A Greedy Approach Idea #1: repeatedly select the product that uses (up) the most operatons. Counter-example: A s 1 5 B s 5 1 C s 1 5 D s 5 1 Greedy dea #1 gves (A*B)*(C*D), whch taes = 2 ops A*((B*C)*D) taes = 1 ops Dynamc Programmng verson Another Greedy Approach Idea #2: repeatedly select the product that uses the fewest operatons. Counter-example: A s B s 11 9 C s 9 1 D s 1 99 Greedy dea #2 gves A*((B*C)*D)), whch taes = ops (A*B)*(C*D) taes =1899 ops The greedy approach s not gvng us the A Recursve Approach Defne subproblems: Fnd the best parentheszaton of A *A +1 * *A. Let N, denote the number of operatons done by ths subproblem. The optmal soluton for the whole problem s N,n-1. Subproblem optmalty: The optmal soluton can be defned n terms of optmal subproblems There has to be a fnal multplcaton (root of the expresson tree) for the optmal soluton. Say, the fnal multply s at ndex : (A * *A )*(A +1 * *A n-1 ). Then the optmal soluton N,n-1 s the sum of two optmal subproblems, N, and N +1,n-1 plus the tme for the last multply. If subproblems were not optmal, nether s global soluton. optmal value. Dynamc Programmng verson Dynamc Programmng verson A Characterzng Equaton Defne global optmal n terms of optmal subproblems, by checng all possble locatons for fnal multply. Recall that A s a d d +1 dmensonal matrx. So, a characterzng equaton for N, s the followng: N, = + < mn{ N, + N + 1, + dd+ 1d 1} Note that subproblems are not ndependent--the subproblems overlap (are shared) A Dynamc Programmng Construct optmal subproblems bottom-up. N, s are easy, so start wth them Then do length 2,3, subproblems, and so on. Array N, stores solutons Runnng tme: O(n 3 ) matrxchan(s): Input: sequence S of n matrces to be multpled Output: number of operatons n an optmal parantheszaton of S for 1 to n-1 do N, for b 1 to n-1 do for to n-b-1 do +b N, +nfnty for to -1 do N, mn{n,, N, +N +1, +d d +1 d +1 } Dynamc Programmng verson Dynamc Programmng verson 1.4 3

6 A Dynamc Programmng Vsualzaton N The bottom-up constructon flls n the N array by dagonals N, gets values from pervous entres n -th row and -th column Fllng n each entry n the N table taes O(n) tme. Total run tme: O(n 3 ) Gettng actual parentheszaton can be done by rememberng for each N entry, = + mn{ N, + N+ 1, + dd+ 1d 1} < answer N n-1 n-1 Dynamc Programmng verson