1 / 15

CSCI 6212 Design and Analysis of Algorithms Dynamic Programming

CSCI 6212 Design and Analysis of Algorithms Dynamic Programming. Dr. Juman Byun The George Washington University. Please drop this course if you have not taken the following prerequisite. Sometimes enthusiasm alone is not enough. CSci 1311: Discrete Structures I (3)

denali
Télécharger la présentation

CSCI 6212 Design and Analysis of Algorithms Dynamic Programming

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CSCI 6212 Design and Analysis of AlgorithmsDynamic Programming • Dr. Juman Byun • The George Washington University • Please drop this course if you have not taken the following prerequisite. Sometimes enthusiasm alone is not enough. • CSci 1311: Discrete Structures I (3) • CSci 1112: Algorithms and Data Structures (3)

  2. n=4 Example: Rod Cutting

  3. n=4 Example: Rod Cutting Maximum Revenue, r4 ?

  4. rn when n=4 ? $10 $9 $1 $8 $5 $5 $8 $1 $1 $1 $5 $1 $5 $1 $5 $1 $1 $1 $1 $1 $1

  5. Notation $10 $5 $5 4-inch rod into 2 pieces Decomposition: 4 = 2 + 2 Maximum Revenue: r4 = $5 + $5

  6. Notation rn n-inch rod into k pieces Decomposition: n = i1 + i2 + … + ik Maximum Revenue:

  7. r1 + rn-1 Uncut Rod of length n pn General Procedure to Find Optimal Rod Cutting Cut Revenue Pick the largest r2 + rn-2 rn-2 + r2 rn-1 + r1

  8. General Procedure to Find Optimal Rod Cutting

  9. General Procedure to Find Optimal Rod Cutting

  10. Recursive Top-Down • Cut-Rod(p,n) • if n == 0 • return 0 • q = ∞ • for i = 1 to n • q = max(q,p[i] + Cut-Rod(p, n - i ) ) • return q

  11. vs Divide-and-conquer • Similarity • to divides problems into subproblems • Difference • subproblems overlap

  12. Can we do better ?

  13. Momoized-Cut-Rod • Memoized-Cut-Rod(p,n) • let r[0..n] be a new array • for i = 0 to n • r[i] = -∞ • return Memoized-Cut-Rod-Aux(p,n,r)

  14. Momoized-Cut-Rod-Aux • Momoized-Cut-Rod-Aux(p,n) • if r[n] >= 0 • return r[n] • if n == 0 • q = 1 • else q = -∞ • for i = 1 to n • q = max(q,p[i]+Memoized-Cut-Rod-Aux(pn,n-i,r)) • r[n] = q • return q

  15. Bottom-Cut-Rod • Bottom-Up-Cut-Rod(p,n) • let r[0..n] be a new array • r[0] = 0 • for j = 1 to n • q = -∞ • for i = 1 to j • q = max(q, p[i] + r[j-i]) • r[j] = q • return r[n]

More Related