Advanced Algorithms | Electrical Engineering and Computer Science | MIT OpenCourseWare

Course Info

Instructor

Prof. Michel Goemans

Departments

As Taught In

Fall 2008

Level

Graduate

Topics

Engineering
- Computer Science
  - Algorithms and Data Structures
  - Theory of Computation

Learning Resource Types

Lecture Notes

Problem Sets

Problem Set Solutions

Download Course

Lecture Notes

Approximaion Algorithms: MAXCUT

Fibonacci heaps

Goldberg-Tarjan Min-Cost Circulation Algorithm

Network Flows

Lecture 3

Lecture 5

Lecture 6 - Splay Trees

Lecture 7 - Dynamic Trees

Lecture 8

Lecture 9

Lecture 10

Lecture 11

Lecture 12 - Ellipsoid algorithm

Lecture 13

Lecture 14

Lecture 15: Interior Point Algorithms for Conic Programming

Lecture 16: Approximation Algorithms

Lecture 17: Approximation algorithms (facility location)

Lecture 18

Lecture 19

Lecture 21: Convex Hull in R2 and Small-d LP’s

Lecture 22

Lecture 23

Course Info

Instructor

Prof. Michel Goemans

Departments

As Taught In

Fall 2008

Level

Graduate

Topics

Engineering
- Computer Science
  - Algorithms and Data Structures
  - Theory of Computation

Learning Resource Types

Lecture Notes

Problem Sets

Problem Set Solutions

Download Course

MIT Open Learning

Over 2,500 courses & materials

Freely sharing knowledge with learners and educators around the world. Learn more

© 2001–2025 Massachusetts Institute of Technology

Accessibility

Creative Commons License

Terms and Conditions

Proud member of:

© 2001–2025 Massachusetts Institute of Technology