1 / 7

CSCI 6212 Design and Analysis of Algorithms The Greedy Method

CSCI 6212 Design and Analysis of Algorithms The Greedy Method. 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)

moses-ellison
Download Presentation

CSCI 6212 Design and Analysis of Algorithms The Greedy Method

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 AlgorithmsThe Greedy Method • 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. Reading assignment p415-p421 Example: Activity-Selection • si:start time • fi:finish time • Maximize the number of mutually compatible activities

  3. Dynamic Programming vs Greedy

  4. Commonality

  5. Differences

  6. 0-1 Knapsack Problem

  7. Fractional Knapsack Problem

More Related