0% found this document useful (0 votes)
115 views

CS 4820-Lecture 14

The document summarizes the topics covered in a lecture on algorithms, including a review of preliminary material like formalizations, graphs, relations and functions. It then discusses greedy algorithms like interval scheduling where greedy approaches stay ahead, and reviews Kruskal's algorithm. Finally, it covers dynamic programming techniques applied to problems involving Fibonacci numbers, weighted interval scheduling, Bellman-Ford shortest paths with negative weights, and hidden Markov models.

Uploaded by

Sean Li
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
115 views

CS 4820-Lecture 14

The document summarizes the topics covered in a lecture on algorithms, including a review of preliminary material like formalizations, graphs, relations and functions. It then discusses greedy algorithms like interval scheduling where greedy approaches stay ahead, and reviews Kruskal's algorithm. Finally, it covers dynamic programming techniques applied to problems involving Fibonacci numbers, weighted interval scheduling, Bellman-Ford shortest paths with negative weights, and hidden Markov models.

Uploaded by

Sean Li
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Sean Li CS 4820 Notes Spring 2013 Introduction to Algorithms Lecture 14 2/20/13 Review of prelim material. No lecture prepared. Topics.

s. Formalizations. Graphs. Relations. Functions. Sets. Matching. Directed/undirected. Connected components. DFS/BFS. Topological sort. Greedy Algorithms. Interval scheduling. Greedy stays ahead. Exchange. Review of Kruskals algorithm. See notes for lecture 7. Dynamic Programming. Fibonacci numbers. Weighted interval scheduling.

Bellman-Ford shortest paths, with negative weights. Hidden Markov Models.

Page 2

You might also like