Scribd Logo
Upload

Welcome to Scribd!

  • CS 4820-Lecture 14

    Uploaded by

    Sean Li
    67 views2 pages
    Notes from lecture. Cornell University, Spring 2013.

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Notes from lecture. Cornell University, Spring 2013.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    67 views2 pages

    CS 4820-Lecture 14

    Uploaded by

    Sean Li
    Notes from lecture. Cornell University, Spring 2013.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 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