CSC 401 Analysis of Algorithms Lecture Notes 12
![CSC 401 – Analysis of Algorithms Lecture Notes 12 Dynamic Programming Objectives: • • CSC 401 – Analysis of Algorithms Lecture Notes 12 Dynamic Programming Objectives: • •](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-1.jpg)
![Matrix Chain-Products Dynamic Programming is a general algorithm design paradigm. – Rather than give Matrix Chain-Products Dynamic Programming is a general algorithm design paradigm. – Rather than give](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-2.jpg)
![Matrix Chain-Products Matrix Chain-Product: – Compute A=A 0*A 1*…*An-1 – Ai is di × Matrix Chain-Products Matrix Chain-Product: – Compute A=A 0*A 1*…*An-1 – Ai is di ×](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-3.jpg)
![A Brute-force Approach Matrix Chain-Product Algorithm: – Try all possible ways to parenthesize A=A A Brute-force Approach Matrix Chain-Product Algorithm: – Try all possible ways to parenthesize A=A](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-4.jpg)
![Greedy Approaches Idea #1: repeatedly select the product that uses (up) the most operations. Greedy Approaches Idea #1: repeatedly select the product that uses (up) the most operations.](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-5.jpg)
![A “Recursive” Approach Define subproblems: – Find the best parenthesization of Ai*Ai+1*…*Aj. – Let A “Recursive” Approach Define subproblems: – Find the best parenthesization of Ai*Ai+1*…*Aj. – Let](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-6.jpg)
![A Characterizing Equation The global optimal has to be defined in terms of optimal A Characterizing Equation The global optimal has to be defined in terms of optimal](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-7.jpg)
![A Dynamic Programming Algorithm Since subproblems overlap, we don’t Algorithm matrix. Chain(S): use recursion. A Dynamic Programming Algorithm Since subproblems overlap, we don’t Algorithm matrix. Chain(S): use recursion.](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-8.jpg)
![A Dynamic Programming Algorithm The bottom-up construction fills in the N array by diagonals A Dynamic Programming Algorithm The bottom-up construction fills in the N array by diagonals](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-9.jpg)
![The General Dynamic Programming Technique Applies to a problem that at first seems to The General Dynamic Programming Technique Applies to a problem that at first seems to](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-10.jpg)
![The 0/1 Knapsack Problem Given: A set S of n items, with each item The 0/1 Knapsack Problem Given: A set S of n items, with each item](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-11.jpg)
![Example Given: A set S of n items, with each item i having – Example Given: A set S of n items, with each item i having –](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-12.jpg)
![A 0/1 Knapsack Algorithm, First Attempt Sk: Set of items numbered 1 to k. A 0/1 Knapsack Algorithm, First Attempt Sk: Set of items numbered 1 to k.](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-13.jpg)
![A 0/1 Knapsack Algorithm, Second Attempt Sk: Set of items numbered 1 to k. A 0/1 Knapsack Algorithm, Second Attempt Sk: Set of items numbered 1 to k.](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-14.jpg)
![The 0/1 Knapsack Algorithm Recall definition of B[k, w]: Since B[k, w] is defined The 0/1 Knapsack Algorithm Recall definition of B[k, w]: Since B[k, w] is defined](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-15.jpg)
![Pseudo-Polynomial Time Algorithms An algorithm is a pseudo-polynomial time algorithm, if the running time Pseudo-Polynomial Time Algorithms An algorithm is a pseudo-polynomial time algorithm, if the running time](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-16.jpg)
- Slides: 16
![CSC 401 Analysis of Algorithms Lecture Notes 12 Dynamic Programming Objectives CSC 401 – Analysis of Algorithms Lecture Notes 12 Dynamic Programming Objectives: • •](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-1.jpg)
CSC 401 – Analysis of Algorithms Lecture Notes 12 Dynamic Programming Objectives: • • • Present the Dynamic Programming paradigm Review the Matrix Chain-Product problem Discuss the General Technique Solve the 0 -1 Knapsack Problem Introduce pseudo-polynomial-time algorithms 1
![Matrix ChainProducts Dynamic Programming is a general algorithm design paradigm Rather than give Matrix Chain-Products Dynamic Programming is a general algorithm design paradigm. – Rather than give](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-2.jpg)
Matrix Chain-Products Dynamic Programming is a general algorithm design paradigm. – Rather than give the general structure, let us first give a motivating example: – Matrix Chain-Products B Review: Matrix Multiplication. e d – O(def ) time j e – C = A×B – A is d × e and B is e × f f A i C i, j d f 2
![Matrix ChainProducts Matrix ChainProduct Compute AA 0A 1An1 Ai is di Matrix Chain-Products Matrix Chain-Product: – Compute A=A 0*A 1*…*An-1 – Ai is di ×](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-3.jpg)
Matrix Chain-Products Matrix Chain-Product: – Compute A=A 0*A 1*…*An-1 – Ai is di × di+1 – Problem: How to parenthesize? Example – B is 3 × 100 – C is 100 × 5 – D is 5 × 5 – (B*C)*D takes 1500 + 75 = 1575 operations – B*(C*D) takes 1500 + 2500 = 4000 operations 3
![A Bruteforce Approach Matrix ChainProduct Algorithm Try all possible ways to parenthesize AA A Brute-force Approach Matrix Chain-Product Algorithm: – Try all possible ways to parenthesize A=A](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-4.jpg)
A Brute-force Approach Matrix Chain-Product Algorithm: – Try all possible ways to parenthesize A=A 0*A 1*…*An-1 – Calculate number of operations for each one – Pick the best one Running time: – The number of paranethesizations is equal to the number of binary trees with n nodes – This is exponential! – It is called the Catalan number, and it is almost 4 n. – This is a terrible algorithm! 4
![Greedy Approaches Idea 1 repeatedly select the product that uses up the most operations Greedy Approaches Idea #1: repeatedly select the product that uses (up) the most operations.](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-5.jpg)
Greedy Approaches Idea #1: repeatedly select the product that uses (up) the most operations. Counter-example: – – – A is 10 × 5 B is 5 × 10 C is 10 × 5 D is 5 × 10 Greedy idea #1 gives (A*B)*(C*D), which takes 500+1000+500 = 2000 operations – A*((B*C)*D) takes 500+250 = 1000 operations Idea #2: repeatedly select the product that uses the fewest operations. Counter-example: – – – A is 101 × 11 B is 11 × 9 C is 9 × 100 D is 100 × 99 Greedy idea #2 gives A*((B*C)*D)), which takes 109989+9900+108900=228 789 operations – (A*B)*(C*D) takes 9999+89991+89100=18909 0 operations The greedy approach is not giving us the optimal value. 5
![A Recursive Approach Define subproblems Find the best parenthesization of AiAi1Aj Let A “Recursive” Approach Define subproblems: – Find the best parenthesization of Ai*Ai+1*…*Aj. – Let](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-6.jpg)
A “Recursive” Approach Define subproblems: – Find the best parenthesization of Ai*Ai+1*…*Aj. – Let Ni, j denote the number of operations done by this subproblem. – The optimal solution for the whole problem is N 0, n-1. Subproblem optimality: The optimal solution can be defined in terms of optimal subproblems – There has to be a final multiplication (root of the expression tree) for the optimal solution. – Say, the final multiply is at index i: (A 0*…*Ai)*(Ai+1*…*An -1). – Then the optimal solution N 0, n-1 is the sum of two optimal subproblems, N 0, i and Ni+1, n-1 plus the time for the last multiply. – If the global optimum did not have these optimal subproblems, we could define an even better “optimal” solution. 6
![A Characterizing Equation The global optimal has to be defined in terms of optimal A Characterizing Equation The global optimal has to be defined in terms of optimal](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-7.jpg)
A Characterizing Equation The global optimal has to be defined in terms of optimal subproblems, depending on where the final multiply is at. Let us consider all possible places for that final multiply: – Recall that Ai is a di × di+1 dimensional matrix. – So, a characterizing equation for Ni, j is the following: Note that subproblems are not independent--the subproblems overlap. 7
![A Dynamic Programming Algorithm Since subproblems overlap we dont Algorithm matrix ChainS use recursion A Dynamic Programming Algorithm Since subproblems overlap, we don’t Algorithm matrix. Chain(S): use recursion.](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-8.jpg)
A Dynamic Programming Algorithm Since subproblems overlap, we don’t Algorithm matrix. Chain(S): use recursion. Input: sequence S of n matrices to be multiplied Instead, we Output: number of operations in an optimal construct optimal paranethization of S subproblems for i 1 to n-1 do “bottom-up. ” Ni, i 0 Ni, i’s are easy, so for b 1 to n-1 do start with them for i 0 to n-b-1 do Then do length j i+b 2, 3, … subproblems, Ni, j +infinity and so on. for k i to j-1 do Running time: Ni, j min{Ni, j , Ni, k +Nk+1, j +di dk+1 dj+1} O(n 3) 8
![A Dynamic Programming Algorithm The bottomup construction fills in the N array by diagonals A Dynamic Programming Algorithm The bottom-up construction fills in the N array by diagonals](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-9.jpg)
A Dynamic Programming Algorithm The bottom-up construction fills in the N array by diagonals Ni, j gets values from pervious entries in i-th row and j-th column Filling in each entry in the N table takes O(n) time. Total run time: O(n 3) Getting actual parenthesization can be done by remembering “k” for each N entry answer N 0 1 2 j … n-1 0 1 … i n-1 9
![The General Dynamic Programming Technique Applies to a problem that at first seems to The General Dynamic Programming Technique Applies to a problem that at first seems to](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-10.jpg)
The General Dynamic Programming Technique Applies to a problem that at first seems to require a lot of time (possibly exponential), provided we have: – Simple subproblems: the subproblems can be defined in terms of a few variables, such as j, k, l, m, and so on. – Subproblem optimality: the global optimum value can be defined in terms of optimal subproblems – Subproblem overlap: the subproblems are not independent, but instead they overlap (hence, should be constructed bottom-up). 10
![The 01 Knapsack Problem Given A set S of n items with each item The 0/1 Knapsack Problem Given: A set S of n items, with each item](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-11.jpg)
The 0/1 Knapsack Problem Given: A set S of n items, with each item i having – bi - a positive benefit – wi - a positive weight Goal: Choose items with maximum total benefit but with weight at most W. If we are not allowed to take fractional amounts, then this is the 0/1 knapsack problem. – In this case, we let T denote the set of items we take – Objective: maximize – Constraint: 11
![Example Given A set S of n items with each item i having Example Given: A set S of n items, with each item i having –](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-12.jpg)
Example Given: A set S of n items, with each item i having – bi - a positive benefit – wi - a positive weight Goal: Choose items with maximum total benefit but with weight at most W. “knapsack” Solution: Items: Weight: Benefit: 1 2 3 4 5 4 in 2 in 6 in 2 in $20 $3 $6 $25 $80 • 5 (2 in) • 3 (2 in) • 1 (4 in) 9 in 12
![A 01 Knapsack Algorithm First Attempt Sk Set of items numbered 1 to k A 0/1 Knapsack Algorithm, First Attempt Sk: Set of items numbered 1 to k.](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-13.jpg)
A 0/1 Knapsack Algorithm, First Attempt Sk: Set of items numbered 1 to k. Define B[k] = best selection from Sk. Problem: does not have subproblem optimality: – Consider S={(3, 2), (5, 4), (8, 5), (4, 3), 10, 9)} weightbenefit pairs Best for S 4: Best for S 5: 13
![A 01 Knapsack Algorithm Second Attempt Sk Set of items numbered 1 to k A 0/1 Knapsack Algorithm, Second Attempt Sk: Set of items numbered 1 to k.](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-14.jpg)
A 0/1 Knapsack Algorithm, Second Attempt Sk: Set of items numbered 1 to k. Define B[k, w] = best selection from Sk with weight exactly equal to w Good news: this does have subproblem optimality: I. e. , best subset of Sk with weight exactly w is either the best subset of Sk-1 w/ weight w or the best subset of Sk-1 w/ weight w-wk plus item k. 14
![The 01 Knapsack Algorithm Recall definition of Bk w Since Bk w is defined The 0/1 Knapsack Algorithm Recall definition of B[k, w]: Since B[k, w] is defined](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-15.jpg)
The 0/1 Knapsack Algorithm Recall definition of B[k, w]: Since B[k, w] is defined in terms of B[k-1, *], we can reuse the same array Running time: O(n. W). Not a polynomial-time algorithm if W is large This is a pseudopolynomial time algorithm Algorithm 01 Knapsack(S, W): Input: set S of items w/ benefit bi and weight wi; max. weight W Output: benefit of best subset with weight at most W for w 0 to W do B[w] 0 for k 1 to n do for w W downto wk do if B[w-wk]+bk > B[w] then B[w] B[w-wk]+bk 15
![PseudoPolynomial Time Algorithms An algorithm is a pseudopolynomial time algorithm if the running time Pseudo-Polynomial Time Algorithms An algorithm is a pseudo-polynomial time algorithm, if the running time](https://slidetodoc.com/presentation_image_h2/b0968dacf98280c462f47d495662d83e/image-16.jpg)
Pseudo-Polynomial Time Algorithms An algorithm is a pseudo-polynomial time algorithm, if the running time of the algorithm depends on the magnitude of a number given in the input, not its encoding size Example: The 0/1 Knapsack algorithm depends on W Not a true polynomial-time algorithm But usually it’s better than the brute-force algorithm 16
Analysis of algorithms lecture notes
Introduction to algorithms lecture notes
Csc 401
01:640:244 lecture notes - lecture 15: plat, idah, farad
Exploratory data analysis lecture notes
Sensitivity analysis lecture notes
Factor analysis lecture notes
Streak plate method
Zline 667-36
Dsp algorithms and architecture
Project procurement management lecture notes
Theology proper lecture notes
Public sector notes
Project management notes
Electricity and magnetism lecture notes
Physics 111 lecture notes
Physical science lecture notes