1 / 26

Lecture 9 Greedy Strategy

Explore the Greedy Strategy, Exchange Property, and Self-Reducible Optimality in solving the Activity Selection Problem using mathematical models. Understand the significance and proof of optimality in the context of Huffman Codes and Binary Tree Representation. Learn about the concept of the Minimum Spanning Tree and practical applications of the Greedy Algorithm. Discover the structural and exchange properties of optimal solutions. Puzzle solutions and insights shared.

lindaf
Download Presentation

Lecture 9 Greedy Strategy

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. Lecture 9 Greedy Strategy

  2. Exchange Property

  3. Activity Selection Problem

  4. Mathematical Model

  5. Exchange Property

  6. Self-Reducible Optimality

  7. Greedy Algorithm

  8. Optimality Proof

  9. Huffman Codes

  10. Problem

  11. Binary Tree Representation

  12. 0 1 0 1 1 0 1 0 1 0

  13. Huffman Tree Problem

  14. Lemma

  15. Exchange Property

  16. Self-reducible Optimality

  17. 0 1 0 1 1 0 1 0 1 0

  18. 0 1 0 1 1 0 1 0 0 1

  19. Idea of Construction

  20. Greedy Construction

  21. Minimum Spanning Tree

  22. What we learnt in this lecture? • How to find greedy algorithm. Exchange property. Structural Property of Optimal Solution Self-reducible optimality.

  23. Puzzle

  24. Solution 1 Solution 2

  25. Thanks End

More Related