CS 580's course blog

Monday, October 29, 2012

Lecture 25 Greedy algorithm

Today, we talked about the application of greedy algorithm on two examples. Minimum Spanning Tree and Activity selection.


Posted by yi at 9:16 AM
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Labels

  • announcement (4)
  • data structure (8)
  • homework (1)
  • homework 2 (1)
  • lecture (21)

Blog Archive

  • ▼  2012 (61)
    • ►  December (5)
    • ►  November (15)
    • ▼  October (15)
      • Lecture 25 Greedy algorithm
      • Homework 4
      • Prim's Algorithm
      • Lecture 24 Multiplying two polynomials and clarifi...
      • Homework 3
      • Homework 2
      • Lecture 23. fast polynomial multiplication algorithm
      • Lecture 22. String matching and polynomial multipl...
      • Course evaluation
      • Lecture 21. KMP algorithm and approximate string m...
      • Grade Distribution of Midterm
      • Lecture 20 String Matching (2)
      • Lecture 19 String Matching (1)
      • Homework 1's grading
      • Lecture 18. Union Find (2)
    • ►  September (14)
    • ►  August (12)

Contributors

  • Siddharth
  • Unknown
  • yi
Simple theme. Powered by Blogger.