Tuesday, January 29, 2013

Lecture - 11 Greedy Algorithms - II

Fernando IX University

More FIX on the NET @ FIX University Cultural Campus

Welcome to Spring Semester 2013

Fernando IX University
Locations of visitors to this page
Fernando IX University

The Best College Radio Stations

Algorithms: Design and Analysis, Part 2

Tim Roughgarden, Associate Professor

In this course you will learn several fundamental principles of advanced algorithm design: greedy algorithms and applications; dynamic programming and applications; NP-completeness and what it means for the algorithm designer; the design and analysis of heuristics; and more.

Current Session:
Dec 3rd 2012 (8 weeks long)Sign Up
Workload: 5-7 hours/week

About the Course

In this course you will learn several fundamental principles of advanced algorithm design. You'll learn the greedy algorithm design paradigm, with applications to computing good network backbones (i.e., spanning trees) and good codes for data compression. You'll learn the tricky yet widely applicable dynamic programming algorithm design paradigm, with applications to routing in the Internet and sequencing genome fragments. You’ll learn what NP-completeness and the famous “P vs. NP” problem mean for the algorithm designer. Finally, we’ll study several strategies for dealing with hard (i.e., NP-complete problems), including the design and analysis of heuristics. Learn how shortest-path algorithms from the 1950s (i.e., pre-ARPANET!) govern the way that your Internet traffic gets routed today; why efficient algorithms are fundamental to modern genomics; and how to make a million bucks in prize money by “just” solving a math problem!

About the Instructor(s)

Tim Roughgarden is an Associate Professor of Computer Science and (by courtesy) Management Science and Engineering at Stanford University, where he holds the Chambers Faculty Scholar development chair. At Stanford, he has taught the Design and Analysis of Algorithms course for the past eight years. His research concerns the theory and applications of algorithms, especially for networks, auctions and other game-theoretic applications, and data privacy. For his research, he has been awarded the ACM Grace Murray Hopper Award, the EATCS-SIGACT Godel Prize, the Presidential Early Career Award for Scientists and Engineers (PECASE), and the Mathematical Programming Society's Tucker Prize.

Course Syllabus

Weeks 1 and 2: The greedy algorithm design paradigm. Applications to optimal caching and scheduling. Minimum spanning trees and applications to clustering. The union-find data structure. Optimal data compression.

Weeks 3 and 4: The dynamic programming design paradigm. Applications to sequence alignment, shortest-path routing, and optimal search trees.

Weeks 5 and 6: Intractable problems and what to do about them. NP-completeness and the P vs. NP question. Solvable special cases. Heuristics with provable performance guarantees. Local search. Exponential-time algorithms that beat brute-force search.

Recommended Background

How to program in at least one programming language (like C, Java, or Python); and familiarity with proofs, including proofs by induction and by contradiction. At Stanford, a version of this course is taken by sophomore, junior, and senior-level computer science majors. The course assumes familiarity with the topics from Algo 1. --- especially asymptotic analysis, basic data structures, and basic graph algorithms.

Suggested Readings

No specific textbook is required for the course. Much of the course material is covered by the well-known textbooks on algorithms, and the student is encouraged to consult their favorite for additional information.

Course Format

The class will consist of lecture videos, generally between 10 and 15 minutes in length. These usually integrated quiz questions. There will also be standalone homeworks and programming assignments that are not part of video lectures, and a final exam.


  • Will I get a statement of accomplishment after completing this class?Yes. Students who successfully complete the class will receive a statement of accomplishment signed by the instructor.
  • Part of the class is over the holidays. How does that work?There will be a two-week "holiday pause" in the middle of the course, between the first 3 weeks and the last 3 weeks of material.
  • How does Algorithms: Design and Analysis differ from the Princeton University algorithms course?The two courses are complementary. That one emphasizes implementation and testing; this one focuses on algorithm design paradigms and relevant mathematical models for analysis. In a typical computer science curriculum, a course like this one is taken by juniors and seniors, and a course like that one is taken by first- and second-year students.

No comments:

Post a Comment


Blog Archive