Scribd Logo
Upload

Welcome to Scribd!

  • CS 4820-Lecture 1

    Uploaded by

    Sean Li
    231 views1 page
    The document summarizes notes from an introduction to algorithms course. It discusses different types of algorithms like greedy, divide and conquer, and dynamic programming. It also covers complexity analysis and the stable matching problem, defining matchings, perfect matchings, and stable matchings in a bipartite graph. It states Gale and Shapley's 1962 result that a perfect stable matching can always be found in such a graph.

    Original Description:

    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
    The document summarizes notes from an introduction to algorithms course. It discusses different types of algorithms like greedy, divide and conquer, and dynamic programming. It also covers complexity analysis and the stable matching problem, defining matchings, perfect matchings, and stable matchings in a bipartite graph. It states Gale and Shapley's 1962 result that a perfect stable matching can always be found in such a graph.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    231 views1 page

    CS 4820-Lecture 1

    Uploaded by

    Sean Li
    The document summarizes notes from an introduction to algorithms course. It discusses different types of algorithms like greedy, divide and conquer, and dynamic programming. It also covers complexity analysis and the stable matching problem, defining matchings, perfect matchings, and stable matchings in a bipartite graph. It states Gale and Shapley's 1962 result that a perfect stable matching can always be found in such a graph.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    Sean Li CS 4820 Notes Spring 2013 Introduction to Design and Analysis of Algorithms Lecture 1 1/21/13 Professor: Dexter Kozen

    en 5143 Upson Hall Text: Kleinberg and Tardos, Algorithm Design. Course Website: http://www.cs.cornell.edu/courses/cs4820/2013sp/ Algorithms. Design and analysis. Some types: Greedy Divide and Conquer Dynamic Programming Flow Intractibility: NP-completeness, e.g. boolean satisfying problem. Approximation Special cases Asymptotic Complexity. f (x) = O(g(x)) if x0 , c such that for all x x0 , f (x) cg(x). Stable Matching Problem. Bipartite matching. Preference: h : c1 > c2 , c : h1 > h2 . Denition. A matching is a set of pairs M H C = {(h, c)|h H, c C} such that no pair shares a node. Denition. A matching is perfect if all nodes are matched. Denition. A matching is unstable if there exist (h1 , c1 ), (h2 , c2 ) M such that h1 : c2 > c1 and c2 : h1 > h2 . A matching is stable if it is not unstable. Result (Gale and Shapley, 1962): Given such a graph, we can always nd a perfect stable matching.

    You might also like