18.409 | Fall 2009 | Graduate

Topics in Theoretical Computer Science: An Algorithmist's Toolkit

Readings

Lecture 4

Description:

Lecture notes on graph partitioning, approximating φ(G) with an integer program, and Cheeger’s inequality.

Resource Type:
Readings
pdf
136 kB
Lecture 4
Download File

Course Info

Departments

As Taught In

Fall 2009

Level

Graduate

Topics

Learning Resource Types

Lecture Notes
Problem Sets
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2026 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2026 Massachusetts Institute of Technology