Scribd Logo
Upload

Welcome to Scribd!

  • Greedy Algorithms: Review: Michael Levin

    Uploaded by

    Priyank Paliwal
    11 views9 pages
    The document discusses the main ingredients of greedy algorithms including making a greedy choice, proving it is a safe move, and reducing the problem to a subproblem that can be solved. It provides examples of safe moves like putting the maximum digit first or refilling gas at the farthest reachable station. The document also notes that problems can sometimes be optimized by assuming data is sorted and choosing a convenient sort order for the greedy approach.

    Original Description:

    greedy-4-review

    Original Title

    _e662941a135b305db0080d672a3e71d6_2-greedy-4-review

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses the main ingredients of greedy algorithms including making a greedy choice, proving it is a safe move, and reducing the problem to a subproblem that can be solved. It provides examples of safe moves like putting the maximum digit first or refilling gas at the farthest reachable station. The document also notes that problems can sometimes be optimized by assuming data is sorted and choosing a convenient sort order for the greedy approach.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    11 views9 pages

    Greedy Algorithms: Review: Michael Levin

    Uploaded by

    Priyank Paliwal
    The document discusses the main ingredients of greedy algorithms including making a greedy choice, proving it is a safe move, and reducing the problem to a subproblem that can be solved. It provides examples of safe moves like putting the maximum digit first or refilling gas at the farthest reachable station. The document also notes that problems can sometimes be optimized by assuming data is sorted and choosing a convenient sort order for the greedy approach.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 9

    Greedy Algorithms:

    Review
    Michael Levin
    Higher School of Economics

    Algorithmic Toolbox
    Data Structures and Algorithms
    Main Ingredients

    Safe move
    Prove safety
    Solve subproblem
    Estimate running time
    Safe Moves

    Put max digit first


    Refill at the farthest reachable gas
    station
    Cover leftmost point
    Use item with maximum value per unit
    of weight
    Optimization

    Assume everything is somehow sorted


    Which sort order is convenient?
    Greedy move can be faster after sorting
    General Strategy

    Problem
    General Strategy
    greedy choice
    Problem

    Make a greedy choice


    General Strategy
    greedy choice
    Problem Safe move

    Make a greedy choice


    Prove that it is a safe move
    General Strategy
    greedy choice
    Problem Safe move

    Subproblem
    Make a greedy choice
    Prove that it is a safe move
    Reduce to a subproblem
    General Strategy
    greedy choice
    Problem Safe move

    Subproblem
    Make a greedy choice
    Prove that it is a safe move
    Reduce to a subproblem
    Solve the subproblem

    You might also like